Two classes of LDPC codes from the space of Hermitian matrices over finite fields

DOI10.3934/amc.2022059zbMath1521.94134OpenAlexW4287964997MaRDI QIDQ6112218

Changli Ma, Qi Wang, Yanan Feng, Meng Zhao

Publication date: 7 July 2023

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

Full work available at URL: https://doi.org/10.3934/amc.2022059

zbMATH Keywords

Hermitian matricesminimum distanceLDPC codesstopping distance

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Bounds on codes (94B65) Other types of codes (94B60)

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum distances of three families of low-density parity-check codes based on finite geometries
• Linear representations of finite geometries and associated LDPC codes
• LDPC Code Designs, Constructions, and Unification
• A linear time erasure-resilient code with nearly optimal recovery
• Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
• LDPC Codes From Generalized Polygons
• Codes on finite geometries
• Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes
• A recursive approach to low complexity codes
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• Good error-correcting codes based on very sparse matrices
• LDPC Codes Based on the Space of Symmetric Matrices Over Finite Fields

This page was built for publication: Two classes of LDPC codes from the space of Hermitian matrices over finite fields