LDPC codes constructed from cubic symmetric graphs

DOI10.1007/s00200-020-00468-2OpenAlexW3093035658MaRDI QIDQ2081552

Dean Crnković, Marina Šimac, Sanja Rukavina

Publication date: 13 October 2022

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.06690

zbMATH Keywords

bipartite graphcubic grapharc-transitive graphLDPC code

Mathematics Subject Classification ID

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

Related Items

LDPC codes from cubic semisymmetric graphs

Uses Software

• LDPC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A refined classification of symmetric cubic graphs
• On the second eigenvalue of a graph
• Linear codes with complementary duals
• Brooks' graph-coloring theorem and the independence number
• \(LCD\) codes from adjacency matrices of graphs
• LDPC codes from \(\mu\)-geodetic graphs obtained from block designs
• On the nullspace of arc-transitive graphs over finite fields
• Explicit construction of graphs with an arbitrary large girth and of large size
• Construction of girth-8 \textit{(3,L)}-QC-LDPC codes of smallest CPM size using column multipliers
• Binary linear complementary dual codes
• On the girth of Tanner \((3,11)\) quasi-cyclic LDPC codes
• A complete classification of cubic symmetric graphs of girth 6
• Graph Theory
• Complementary Dual Codes for Counter-Measures to Side-Channel Attacks
• Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
• Fundamentals of Error-Correcting Codes
• Minimum-distance bounds by graph analysis
• Good error-correcting codes based on very sparse matrices
• Channel Codes
• A textbook of graph theory

This page was built for publication: LDPC codes constructed from cubic symmetric graphs