Some low-density parity-check codes derived from finite geometries

DOI10.1007/s10623-009-9324-9zbMath1185.05033OpenAlexW2077024988MaRDI QIDQ2267793

Peter Vandendriessche

Publication date: 2 March 2010

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-009-9324-9

zbMATH Keywords

dimensionlinear representationerror rateLDPClow density parity check codesgeneralzed quadrangleLU(3,q)

Mathematics Subject Classification ID

Paths and cycles (05C38) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Generalized quadrangles and generalized polygons in finite geometry (51E12) Linear codes and caps in Galois spaces (51E22) Combinatorial aspects of finite geometries (05B25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Blocking sets, ovals, (k)-arcs (51E21)

Related Items (7)

Large weight code words in projective space codes ⋮ On the search of smallest QC-LDPC code with girth six and eight ⋮ Codes of Desarguesian projective planes of even order, projective triads and \((q+t,t)\)-arcs of type \((0, 2, t)\) ⋮ On the dual code of points and generators on the Hermitian variety \(\mathcal{H}(2n+1,q^2)\) ⋮ Eigenvalues and expansion of bipartite graphs ⋮ Construction of girth-8 \textit{(3,L)}-QC-LDPC codes of smallest CPM size using column multipliers ⋮ Linear representations of finite geometries and associated LDPC codes

Uses Software

• LDPC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Codes associated with generalized polygons
• Explicit constructions of graphs without short cycles and low density codes
• Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
• Expander codes
• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
• Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
• LDPC Codes From Generalized Polygons
• LDPC Block and Convolutional Codes Based on Circulant Matrices
• On the Dimensions of Certain LDPC Codes Based on$q$-Regular Bipartite Graphs
• Small weight codewords in the LDPC codes arising from linear representations of geometries
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• Good error-correcting codes based on very sparse matrices
• Ovals In a Finite Projective Plane

This page was built for publication: Some low-density parity-check codes derived from finite geometries