On the minimum distance of array codes as LDPC codes

DOI10.1109/TIT.2003.820053MaRDI QIDQ3547199zbMATH OpenFDO

Authors Kyeongcheol Yang, Tor Helleseth

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

minimum distancelow-density parity-check codesLDPCcodewords of weight 6 and 8

Mathematics Subject Classification ID

Bounds on codes (94B65)

Recommendations

• Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
• Minimum distances of three families of low-density parity-check codes based on finite geometries
• Small weight codewords in the LDPC codes arising from linear representations of geometries
• On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices
• A note on the minimum distance of quantum LDPC codes

Cited in

(6)

• AN ALGORITHMIC APPROACH TO ACHIEVE MINIMUM $\\rho$-DISTANCE AT LEAST d IN LINEAR ARRAY CODES
• New and explicit constructions of unbalanced Ramanujan bipartite graphs
• Minimum distances of three families of low-density parity-check codes based on finite geometries
• The minimum distance of codes in an array coming from telescopic semigroups
• On the class of array-based APM-LDPC codes
• On the Smallest Absorbing Sets of LDPC Codes From Finite Planes

This page was built for publication: On the minimum distance of array codes as LDPC codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547199)