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

DOI10.1007/s11464-016-0530-2zbMath1335.94095OpenAlexW2293691695MaRDI QIDQ282404

Yanan Feng, Changli Ma, Lu Wang, Shuo Deng

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

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

Related Items

On the stopping distance of LDPC codes based on symplectic space over finite fields, Two classes of LDPC codes from the space of Hermitian matrices over finite fields, Verifiable quantum secret sharing scheme based on LDPC codes, Constructions of (r,t)-LRC Based on Totally Isotropic Subspaces in Symplectic Space Over Finite Fields

Cites Work

• Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
• Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
• On the minimum distance of array codes as LDPC codes
• On the Dimensions of Certain LDPC Codes Based on$q$-Regular Bipartite Graphs
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• Unnamed Item