A class of LDPC codes based on attenuated polar spaces

DOI10.1016/J.FFA.2026.102917MaRDI QIDQ7411476zbMATH OpenFDO

Authors Yanan Feng, Changli Ma, Caihong Zhu

Publication date 2027

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.FFA.2026.102917

zbMATH Keywords

attenuated spacefinite classical polar spaceLDPC codeminimum distancestopping distance

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Cites work

• A class of LDPC codes based on symplectic space over finite fields
• A recursive approach to low complexity codes
• Codes on finite geometries
• Designs in finite classical polar spaces
• Error-correcting codes in attenuated space over finite fields
• Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
• Finite-length analysis of low-density parity-check codes on the binary erasure channel
• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• LDPC Codes Based on the Space of Symmetric Matrices Over Finite Fields
• LDPC Codes From Generalized Polygons
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• Minimum distances of three families of low-density parity-check codes based on finite geometries
• On the stopping distance and the stopping redundancy of codes
• On the stopping distance of LDPC codes based on symplectic space over finite fields
• Substructures of finite classical polar spaces
• Two classes of LDPC codes from the space of Hermitian matrices over finite fields

This page was built for publication: A class of LDPC codes based on attenuated polar spaces

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