LDPC Codes From Generalized Polygons

DOI10.1109/TIT.2005.856936zbMath1318.94112OpenAlexW2145244895MaRDI QIDQ3547306

Zhenyu Liu, Dimitrios A. Pados

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2005.856936

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (12)

Codes with girth 8 Tanner graph representation ⋮ Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles ⋮ Two classes of LDPC codes from the space of Hermitian matrices over finite fields ⋮ Explicit non-malleable codes from bipartite graphs ⋮ Large weight code words in projective space 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 ⋮ Small weight codewords in the LDPC codes arising from linear representations of geometries ⋮ Algebraic Codes and Geometry of Some Classical Generalized Polygons ⋮ Moderate-density parity-check codes from projective bundles

This page was built for publication: LDPC Codes From Generalized Polygons