Mathematical analysis of an iterative decoding algorithm for low-density codes (Q5930867): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:32, 30 January 2024
scientific article; zbMATH DE number 1592153
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
