Mathematical analysis of an iterative decoding algorithm for low-density codes (Q5930867)
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: Mathematical analysis of an iterative decoding algorithm for low-density codes |
scientific article; zbMATH DE number 1592153
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mathematical analysis of an iterative decoding algorithm for low-density codes |
scientific article; zbMATH DE number 1592153 |
Statements
Mathematical analysis of an iterative decoding algorithm for low-density codes (English)
0 references
26 April 2001
0 references
A two-phase iterative algorithm for decoding of low-density codes is proposed and analyzed. It is proved that the decoding error probability approaches zero when the code length grows to infinity.
0 references
iterative algorithm
0 references
decoding
0 references
low-density codes
0 references
0.8359904885292053
0 references
0.8245059847831726
0 references
0.8230499625205994
0 references
