Codes with girth 8 Tanner graph representation (Q2638415)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5786119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Codes with girth 8 Tanner graph representation |
scientific article; zbMATH DE number 5786119 |
Statements
Codes with girth 8 Tanner graph representation (English)
0 references
16 September 2010
0 references
\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.
0 references
Tanner graph
0 references
\(\{C _{4},C _{6}\}\)-cycle-free
0 references
girth 8
0 references
0 references
0 references
0.85060346
0 references
0 references
0 references
0.8396869
0 references
0.8388735
0 references
