Combinatorial constructions of low-density parity check codes for iterative decoding
- 25 June 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We introduce a combinatorial construction of regular low-density parity check (LDPC) codes based on balanced incomplete block designs, or more specifically on cyclic difference families of Abelian groups and affine geometries. Several constructions are presented, and the bounds on minimal distance are derived by using the concept of Pasch configurations.Keywords
This publication has 5 references indexed in Scilit:
- Structured iteratively decodable codes based on Steiner systems and their application in magnetic recordingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Low-density parity-check codes based on finite geometries: a rediscovery and new resultsIEEE Transactions on Information Theory, 2001
- Constructions of (q, k, 1) difference families with q a prime power and k = 4,5Discrete Mathematics, 1995
- Self-orthogonal quasi-cyclic codesIEEE Transactions on Information Theory, 1967
- Difference-Set Cyclic CodesBell System Technical Journal, 1966