Bounds on the Cardinality of Subspace Codes with Non-maximum Code Distance.
Ernst M. GabidulinNina I. PilipchukO. V. TrushinaPublished in: Probl. Inf. Transm. (2021)
Keyphrases
- minimum distance
- error correcting codes
- upper bound
- error correcting
- code length
- lower bound
- error control
- feature space
- error correction
- high dimensional data
- upper and lower bounds
- low dimensional
- principal component analysis
- distance function
- subspace clustering
- source code
- error detection
- subspace learning
- binary codes
- hamming distance
- maximum distance
- block codes
- lower dimensional
- distance measure
- worst case
- high dimensional
- lower and upper bounds
- maximum number
- dimensionality reduction
- knn
- reed solomon codes