Small weight codewords in the LDPC codes arising from linear representations of geometries

DOI10.1002/jcd.20179zbMath1161.94010OpenAlexW2020483514MaRDI QIDQ3614748

Geertrui Van de Voorde, Storme, L., Valentina Pepe

Publication date: 9 March 2009

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://biblio.ugent.be/publication/682264

zbMATH Keywords

linear representationhyperovalminimum distancesmall weight codewordsLDPC code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20)

Related Items (10)

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)\) ⋮ 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 ⋮ Linear representations of finite geometries and associated LDPC codes ⋮ Locally repairable codes with high availability based on generalised quadrangles ⋮ Split Clique Graph Complexity ⋮ Moderate-density parity-check codes from projective bundles

Uses Software

• LDPC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit constructions of graphs without short cycles and low density codes
• On \((q+t,t)\)-arcs of type \((0,2,t)\)
• Small complete caps in spaces of even characteristic
• Quadrangles of order \((s-1,s+1)\).
• On (q + t)-arcs of type (0, 2, t) in a desarguesian plane of order q
• On complete caps and ovaloids in three-dimensional Galois spaces of characteristic two
• 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
• 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 the LDPC codes arising from linear representations of geometries