Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6.
Daniel HeinleinThomas HonoldMichael KiermaierSascha KurzAlfred WassermannPublished in: Des. Codes Cryptogr. (2019)
Keyphrases
- minimum distance
- error correcting codes
- upper bound
- nearest neighbor
- distance measurement
- euclidean distance
- convex hull
- gray level images
- minimum distance classifier
- convex polyhedra
- logical operations
- high dimensional data
- error correcting
- error correction
- grassmann manifold
- image processing
- gray level
- active learning
- lower bound
- feature space