Detecting cycles of length 10 in the Tanner graph of a QC-LDPC code based on protograph analysis (Q2229575)
From MaRDI portal
!
WARNING
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 7312360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting cycles of length 10 in the Tanner graph of a QC-LDPC code based on protograph analysis |
scientific article; zbMATH DE number 7312360 |
Statements
Detecting cycles of length 10 in the Tanner graph of a QC-LDPC code based on protograph analysis (English)
0 references
18 February 2021
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
0 references
0.94224733
0 references
0.88560903
0 references
0.88242984
0 references
0.86938703
0 references
0.8628932
0 references
0.8511435
0 references
0.8498508
0 references
0.84378195
0 references
