Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
From MaRDI portal
Publication:3547746
DOI10.1109/TIT.2004.828066zbMath1303.94140MaRDI QIDQ3547746
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (8)
NEW CLASS OF QUANTUM CODES CONSTRUCTED FROM CYCLIC DIFFERENCE SET ⋮ On the girth of Tanner \((3,11)\) quasi-cyclic LDPC codes ⋮ MaxMinSum Steiner Systems for Access Balancing in Distributed Storage ⋮ Super-simple \((v, 5, 2)\) directed designs and their smallest defining sets with application in LDPC codes ⋮ Nonexistence of sparse triple systems over abelian groups and involutions ⋮ Construction of LDPC convolutional codes via difference triangle sets ⋮ Plateaued functions and one-and-half difference sets ⋮ High-rate LDPC codes from partially balanced incomplete block designs
This page was built for publication: Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding