Minimum distance and pseudodistance lower bounds for generalised LDPC codes
From MaRDI portal
(Redirected from Publication:622792)
Recommendations
- Upper bounds on the rate of LDPC codes as a function of minimum distance
- Minimum-distance bounds by graph analysis
- Distance Bounds for an Ensemble of LDPC Convolutional Codes
- Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes
- Performance of low-density parity-check codes with linear minimum distance
Cited in
(10)- New results on the pseudoredundancy
- Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance
- Minimum-distance bounds by graph analysis
- Upper bounds on the rate of LDPC codes as a function of minimum distance
- Lower bounds on the minimum distance of long codes in the Lee metric
- Generalized minimum-distance decoding of Euclidean-space codes and lattices
- Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization
- Upper bound on the minimum distance of LDPC codes over \(\mathrm{GF}(q)\) based on counting the number of syndromes
- Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes
- Distance properties of short LDPC codes and their impact on the BP, ML and near-ML decoding performance
This page was built for publication: Minimum distance and pseudodistance lower bounds for generalised LDPC codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622792)
