Minimum distances of three families of low-density parity-check codes based on finite geometries

DOI10.1007/S11464-016-0530-2MaRDI QIDQ282404zbMATH OpenOpenAlexFDO

Authors Yanan Feng, Shuo Deng, Changli Ma, Lu Wang

Publication date 12 May 2016

Published in Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11464-016-0530-2

zbMATH Keywords

minimum distanceorthogonallow-density parity-check (LDPC) codesymplecticunitary

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Linear codes (general theory) (94B05)

Recommendations

• Some low-density parity-check codes derived from finite geometries
• LDPC codes associated with linear representations of geometries
• Galois geometries and low-density parity-check codes
• scientific article; zbMATH DE number 2063211
• Low-density parity-check codes based on finite geometries: a rediscovery and new results

Cites work

• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• On the Dimensions of Certain LDPC Codes Based on$q$-Regular Bipartite Graphs
• On the minimum distance of array codes as LDPC codes
• Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles

Cited in

(10)

• Verifiable quantum secret sharing scheme based on LDPC codes
• A family of low density matrices in Lagrangian-Grassmannian
• On the stopping distance of LDPC codes based on symplectic space over finite fields
• Some low-density parity-check codes derived from finite geometries
• Constructions of \((r,t)\)-LRC based on totally isotropic subspaces in symplectic space over finite fields
• Two classes of LDPC codes from the space of Hermitian matrices over finite fields
• Average spectra and minimum distances of low-density parity-check codes over Abelian groups
• On the minimum distance of array codes as LDPC codes
• 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

This page was built for publication: Minimum distances of three families of low-density parity-check codes based on finite geometries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q282404)