Linear growing minimum distance of ultra-sparse non-binary cluster-LDPC codes.
Valentin SavinDavid DeclercqPublished in: ISIT (2011)
Keyphrases
- non binary
- minimum distance
- ldpc codes
- decoding algorithm
- constraint satisfaction problems
- upper bound
- frequent pattern mining
- nearest neighbor
- euclidean distance
- high dimensional
- error correction
- arc consistency
- convex hull
- search space
- message passing
- np complete
- data mining
- knn
- multiresolution
- video sequences
- similarity measure
- feature extraction
- image processing