Regular LDPC codes from semipartial geometries

DOI10.1007/s10440-007-9186-yzbMath1142.51012OpenAlexW2071457013MaRDI QIDQ925272

Chen Zhang, Jun Shen, Xiu-Li Li

Publication date: 3 June 2008

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10440-007-9186-y

zbMATH Keywords

Gallager codesIterative decodingLow-density parity-check (LDPC) codesSemipartial geometries

Mathematics Subject Classification ID

Decoding (94B35) Finite geometry and special incidence structures (51E99)

Related Items

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)\)

Cites Work

• On the \(p\)-rank of the adjacency matrices of strongly regular graphs
• Semi-partial geometries and spreads of classical polar spaces
• Ovoides et groupes de Suzuki
• On semipartial geometries
• Strongly regular graphs, partial geometries and partially balanced designs
• Iterative decoding of one-step majority logic deductible codes based on belief propagation
• Twelve points in PG (5, 3) with 95040 self-transformations
• 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
• Some applications of Magma in designs and codes: Oval designs, Hermitian unitals and generalized Reed-Muller codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item