An improvement of the Johnson bound for subspace codes.
Michael KiermaierSascha KurzPublished in: CoRR (2017)
Keyphrases
- upper bound
- worst case
- lower bound
- low dimensional
- error correction
- high dimensional
- principal component analysis
- feature space
- significant improvement
- motion estimation
- error correcting codes
- hilbert space
- subspace learning
- subspace clustering
- principal components
- high dimensional data
- data sets
- computational complexity
- feature extraction
- genetic algorithm
- information retrieval