Minimum distance and pseudodistance lower bounds for generalised LDPC codes

From MaRDI portal

Publication:622792

Jump to:navigation, search

DOI10.1504/IJICOT.2010.032546zbMath1204.94100OpenAlexW2060338345MaRDI QIDQ622792

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

zbMATH Keywords

eigenvalues lower bounds minimum distance LDPC codes stopping set iterative decoding pseudodistance bit-oriented bound code graph constraint-oriented bound generalised LDPC codes linear programming decoding low-density parity check codes parity-oriented bound pseudoweight stopping distance tanner graph

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:622792&oldid=12516711"