Codes with girth 8 Tanner graph representation

DOI10.1007/s10623-009-9349-0zbMath1202.94235OpenAlexW2034670354MaRDI QIDQ2638415

Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario

Publication date: 16 September 2010

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-009-9349-0

zbMATH Keywords

Tanner graph\(\{C _{4},C _{6}\}\)-cycle-freegirth 8

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05) Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15)

Related Items (3)

QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field ⋮ On the search of smallest QC-LDPC code with girth six and eight ⋮ Construction of girth-8 \textit{(3,L)}-QC-LDPC codes of smallest CPM size using column multipliers

Cites Work

• Unnamed Item
• Unnamed Item
• \(C_ 6\)-free bipartite graphs and product representation of squares
• The size of bipartite graphs with a given girth
• Triangle-Free Hypergraphs
• Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
• LDPC Codes From Generalized Polygons
• Iterative Decoding of Linear Block Codes: A Parity-Check Orthogonalization Approach
• Which Codes Have$4$-Cycle-Free Tanner Graphs?
• A recursive approach to low complexity codes
• Which codes have cycle-free Tanner graphs?
• Bounds on the minimum distance of the duals of BCH codes

This page was built for publication: Codes with girth 8 Tanner graph representation