Codes with girth 8 Tanner graph representation

DOI10.1007/S10623-009-9349-0MaRDI QIDQ2638415zbMATH OpenOpenAlexFDO

Authors 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

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

Mathematics Subject Classification ID

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

Review text

\textit{T. Halford} et al [IEEE Trans. Inform. Theory 52, No. 9, 4219--4223 (2006)] gave a necessary condition for a code to be represented by a 4-cycle-free Tanner graph. Here the authors extend this condition for 4 and 6 cycle-free Tanner graphs. They found a new necessary condition for codes having Tanner graph representation with girth 8. The results are also applied for some well known (Reed Muller, BCH and RS) low rate codes.

Recommendations

• Codes on planar Tanner graphs
• Some optimal codes related to graphs invariant under the alternating group A₈
• Graph-based codes
• On the [162,8,80] codes
• New linear codes over GF(8)
• Codes over graphs
• Codes from Expander Graphs
• scientific article; zbMATH DE number 169589
• An explicit method to generate some QC LDPC codes with girth 8
• Codes from incidence matrices of graphs

Cites work

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

Cited in

(9)

• 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
• Optimal codes as Tanner codes with cyclic component codes
• On the girth of Tanner \((3,11)\) quasi-cyclic LDPC codes
• On full-rank parity-check matrices of product codes
• Which Codes Have$4$-Cycle-Free Tanner Graphs?
• Which codes have cycle-free Tanner graphs?
• Detecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysis

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

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