On generalized Hamming weights of binary primitive BCH codes with minimum distance one less than a power of two.
Jay ChengChi-Chao ChaoPublished in: IEEE Trans. Inf. Theory (1997)
Keyphrases
- minimum distance
- error correcting codes
- upper bound
- error correcting
- hamming distance
- nearest neighbor
- error correction
- error detection
- distance measurement
- reed solomon
- logical operations
- minimum distance classifier
- gray level images
- convex hull
- euclidean distance
- binary codes
- convex polyhedra
- data sets
- decoding algorithm
- non binary
- distance measure
- high quality