LDPC codes from Deza graphs

DOI10.1134/S0032946025030019MaRDI QIDQ6878951zbMATH OpenFDO

Authors Dean Crnković, Sanja Rukavina, Marina Šimac

Publication date 5 January 2026

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0032946025030019

zbMATH Keywords

Deza graphLDPC codeMoore graphstrongly regular graph

Mathematics Subject Classification ID

Graph theory (05C99) Linear codes (general theory) (94B05)

Cites work

• \(LCD\) codes from adjacency matrices of graphs
• Binary linear complementary dual codes
• Channel Codes
• Complementary dual codes for counter-measures to side-channel attacks
• Deza graphs: A generalization of strongly regular graph
• Finite-length analysis of low-density parity-check codes on the binary erasure channel
• Good error-correcting codes based on very sparse matrices
• scientific article; zbMATH DE number 3251924 (Why is no real title available?)
• LDPC codes constructed from cubic symmetric graphs
• LDPC codes from \(\mu\)-geodetic graphs obtained from block designs
• LDPC codes from cubic semisymmetric graphs
• Linear codes with complementary duals
• On the Dynamics of the Error Floor Behavior in (Regular) LDPC Codes
• Spectra of graphs
• The Hoffman-Singleton graph and its automorphisms

Cited in

(1)

• LDPC codes from Deza digraphs

This page was built for publication: LDPC codes from Deza graphs

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