On the Dimensions of Certain LDPC Codes Based on$q$-Regular Bipartite Graphs

DOI10.1109/TIT.2006.878231zbMath1309.94172arXivcs/0506011MaRDI QIDQ3548096

Qing Xiang, Peter K. W. 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)

Related Items (7)

Minimum distances of three families of low-density parity-check codes based on finite geometries ⋮ Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles ⋮ Recent Developments in Low-Density Parity-Check Codes ⋮ Eigenvalues and expansion of bipartite graphs ⋮ Some low-density parity-check codes derived from finite geometries ⋮ Linear representations of finite geometries and associated LDPC codes ⋮ The dimensions of \(LU(3,q)\) codes

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