Decoding of repeated-root cyclic codes up to new bounds on their minimum distance.
Alexander ZehMarkus UlmschneiderPublished in: Probl. Inf. Transm. (2015)
Keyphrases
- minimum distance
- error correcting codes
- upper bound
- decoding algorithm
- error correcting
- lower bound
- parity check
- error control
- error correction
- reed solomon
- low density parity check
- ldpc codes
- joint source channel
- euclidean distance
- distance measurement
- minimum distance classifier
- reed solomon codes
- convex polyhedra
- error detection
- convex hull
- nearest neighbor
- neural network
- gray level images
- noise model
- feature vectors
- feature extraction
- computer vision
- machine learning