Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles

DOI10.1007/s10623-006-9017-6zbMath1123.51015OpenAlexW2043123152MaRDI QIDQ2383983

Keith E. Mellinger, Jon-Lark Kim, Storme, L.

Publication date: 20 September 2007

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

Full work available at URL: https://doi.org/10.1007/s10623-006-9017-6

zbMATH Keywords

generalized quadrangleminimum distanceLDPC codelow-density parity check

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Generalized quadrangles and generalized polygons in finite geometry (51E12) Combinatorial codes (94B25) Finite geometry and special incidence structures (51E99)

Related Items (10)

Minimum distances of three families of low-density parity-check codes based on finite geometries ⋮ Large weight code words in projective space codes ⋮ Some combinatorial aspects of constructing bipartite-graph codes ⋮ 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)\) ⋮ A study of intersections of quadrics having applications on the small weight codewords of the functional codes \(C_2(Q)\), \(Q\) a non-singular quadric ⋮ Some low-density parity-check codes derived from finite geometries ⋮ On codewords in the dual code of classical generalised quadrangles and classical polar spaces ⋮ Locally repairable codes with high availability based on generalised quadrangles ⋮ Moderate-density parity-check codes from projective bundles

Uses Software

• LDPC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Codes associated with generalized polygons
• Explicit constructions of graphs without short cycles and low density codes
• Explicit construction of graphs with an arbitrary large girth and of large size
• 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
• A recursive approach to low complexity codes
• Minimum-distance bounds by graph analysis
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• Good error-correcting codes based on very sparse matrices

This page was built for publication: Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles