Codes with girth 8 Tanner graph representation (Q2638415)

\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.