On Algebraic Construction of Gallager and Circulant Low-Density Parity-Check Codes
From MaRDI portal
Publication:3547693
DOI10.1109/TIT.2004.828088zbMATH Open1287.94121MaRDI QIDQ3547693FDOQ3547693
Authors: Heng Tang, Jun Xu, Yu Kou, Shu Lin, Khaled Abdel-Ghaffar 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
- Geometric constructions of Gallager codes
- scientific article; zbMATH DE number 1982620
- Construction of Low-Density Parity-Check Codes Based on Balanced Incomplete Block Designs
- Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
Cyclic codes (94B15) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Cited In (9)
- Low-rank parity-check codes over Galois rings
- LDPC codes associated with linear representations of geometries
- LDPC codes: A group algebra formulation
- Title not available (Why is that?)
- Linear representations of finite geometries and associated LDPC codes
- Construction of Low-Density Parity-Check Codes Based on Balanced Incomplete Block Designs
- Algebraic constructions of LDPC codes with no short cycles
- LDPC codes from Singer cycles
- Exploiting coding theory for classification: an LDPC-based strategy for multiclass-to-binary decomposition
This page was built for publication: On Algebraic Construction of Gallager and Circulant Low-Density Parity-Check Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547693)
