On the Dimensions of Certain LDPC Codes Based onq-Regular Bipartite Graphs

DOI10.1109/TIT.2006.878231MaRDI QIDQ3548096zbMATH OpenFDO

Authors Qing Xiang, Peter Sin

Publication date 21 December 2008

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

Full work available at URL https://arxiv.org/abs/cs/0506011

zbMATH Keywords

binary low-density parity check (LDPC) codes

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Abstract: An explicit construction of a family of binary LDPC codes called LU(3,q), where q is a power of a prime, was recently given. A conjecture was made for the dimensions of these codes when q is odd. The conjecture is proved in this note. The proof involves the geometry of a 4-dimensional symplectic vector space and the action of the symplectic group and its subgroups.

Recommendations

• The dimensions of \(LU(3,q)\) codes
• Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
• LDPC codes associated with linear representations of geometries
• LDPC codes from Singer cycles
• Binary LDPC codes constructed based on symplectic spaces over finite fields

Cited in

(9)

• The dimensions of \(LU(3,q)\) codes
• Some low-density parity-check codes derived from finite geometries
• Linear representations of finite geometries and associated LDPC codes
• 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
• Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
• Binary LDPC codes constructed based on symplectic spaces over finite fields
• Recent Developments in Low-Density Parity-Check Codes
• Eigenvalues and expansion of bipartite graphs

This page was built for publication: On the Dimensions of Certain LDPC Codes Based on$q$-Regular Bipartite Graphs

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