A class of LDPC codes based on symplectic space over finite fields

DOI10.3934/AMC.2025047MaRDI QIDQ6852082zbMATH OpenFDO

Authors Yanan Feng, Chuchen Tang

Publication date 26 February 2026

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/AMC.2025047

zbMATH Keywords

minimum distancesymplectic spaceLDPC codetotally isotropic subspacestopping distance

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Cites work

• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• Codes on finite geometries
• 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
• LDPC Codes Based on the Space of Symmetric Matrices Over Finite Fields
• LDPC Codes From Generalized Polygons
• LDPC code designs, constructions, and unification
• 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 p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry
• On the stopping distance and the stopping redundancy of codes
• 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

This page was built for publication: A class of LDPC codes based on symplectic space over finite fields

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