On the minimum subspace coding capacity of multiplicative finite-field matrix channels with a given rank distribution.
Chenchen LiuXiaolin LiBaojian ZhouWai Ho MowPublished in: APCC (2016)
Keyphrases
- coding scheme
- unit length
- singular vectors
- singular values
- principal component analysis
- singular value decomposition
- null space
- discrete random variables
- high dimensional
- laplace transform
- update rule
- affinity matrix
- subspace learning
- communication channels
- dimensionality reduction
- probability distribution
- projection matrix
- multi channel
- dot product
- low dimensional
- qr decomposition
- motion estimation