Detecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysis (Q784385)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Detecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysis |
scientific article; zbMATH DE number 7226808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysis |
scientific article; zbMATH DE number 7226808 |
Statements
Detecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysis (English)
0 references
3 August 2020
0 references
Tanner graph
0 references
protograph
0 references
expanded graph
0 references
union of cycles
0 references
base equation
0 references
extrinsic message degree
0 references
LDPC code
0 references
