Minimum distance and pseudodistance lower bounds for generalised LDPC codes
DOI10.1504/IJICOT.2010.032546zbMATH Open1204.94100OpenAlexW2060338345MaRDI QIDQ622792FDOQ622792
Authors: Christine A. Kelley 
Publication date: 4 February 2011
Published in: International Journal of Information and Coding Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1504/ijicot.2010.032546
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
eigenvalueslower boundsminimum distanceLDPC codesstopping setiterative decodingpseudodistancebit-oriented boundcode graphconstraint-oriented boundgeneralised LDPC codeslinear programming decodinglow-density parity check codesparity-oriented boundpseudoweightstopping distancetanner graph
Cited In (10)
- Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes
- Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance
- Lower bounds on the minimum distance of long codes in the Lee metric
- Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization
- Upper bounds on the rate of LDPC codes as a function of minimum distance
- New results on the pseudoredundancy
- Generalized minimum-distance decoding of Euclidean-space codes and lattices
- Minimum-distance bounds by graph analysis
- Distance properties of short LDPC codes and their impact on the BP, ML and near-ML decoding performance
- Upper bound on the minimum distance of LDPC codes over \(\mathrm{GF}(q)\) based on counting the number of syndromes
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)
