On the typical minimum distance of protograph-based non-binary LDPC codes.
Dariush DivsalarLara DolecekPublished in: ITA (2012)
Keyphrases
- non binary
- minimum distance
- ldpc codes
- decoding algorithm
- constraint satisfaction problems
- upper bound
- euclidean distance
- nearest neighbor
- convex hull
- arc consistency
- frequent pattern mining
- gray level images
- message passing
- error correction
- search space
- special case
- hidden variables
- constraint satisfaction
- gray level
- maximum likelihood