LDPC codes from Singer cycles

DOI10.1016/j.dam.2009.01.013zbMath1167.94007arXiv0709.2813OpenAlexW2026012853MaRDI QIDQ1026131

Luca Giuzzi, Angelo Sonnino

Publication date: 24 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

projective spaceSinger cycleLDPC code

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Combinatorial structures in finite projective spaces (51E20)

Related Items

Families of twisted tensor product codes, Codes and caps from orthogonal Grassmannians

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite Sperner spaces constructed from projective and affine spaces
• On a set of lines of \(PG(3,q)\) corresponding to a maximal cap contained in the Klein quadric of \(PG(5,q)\).
• Normal spreads
• Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane
• The construction of translation planes from projective spaces
• Endcoding Complexity Versus Minimum Distance
• On Algebraic Construction of Gallager and Circulant Low-Density Parity-Check Codes
• The Theory of Information and Coding
• Efficient encoding of low-density parity-check codes
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• A comparison of known codes, random codes, and the best codes
• Good error-correcting codes based on very sparse matrices
• On the complexity of minimum distance decoding of long linear codes