DocumentCode
2050433
Title
On the suboptimality of iterative decoding for finite length codes
Author
Isaka, Motohiko ; Fossorier, Marc ; Imai, Hideki
Author_Institution
Dept. of Informatics, Kwansei Gakuin Univ., Japan
fYear
2002
fDate
2002
Firstpage
4
Abstract
We investigate the property of iterative decoding for finite length codes, and give some insights on the suboptimality of iterative decoding due to the cycles in the graph representation of the codes, for several different types of iteratively decodable codes.
Keywords
graph theory; iterative decoding; parity check codes; turbo codes; LDPC codes; finite length codes; graph representation; iterative decoding; low-density parity-check codes; suboptimality; turbo-like codes; Convergence; Error analysis; Informatics; Iterative decoding; Parity check codes; Probability; Statistics; Stress; Trajectory; Turbo codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023276
Filename
1023276
Link To Document