DocumentCode
2052314
Title
On the effect of parity-check weights in iterative decoding
Author
Santhi, Nandakishore ; Vardy, Alexander
Author_Institution
Univ. of California San Diego, La Jolla, CA, USA
fYear
2004
fDate
27 June-2 July 2004
Firstpage
101
Abstract
It is well-established "folk knowledge" that in order to be iteratively decodable, a code should have a sparse parity-check matrix, as it has some qualitative and quantitative properties for finite-length codes.
Keywords
binary codes; block codes; error correction codes; iterative decoding; linear codes; parity check codes; sparse matrices; finite-length code; iterative decoding; qualitative-quantitative property; sparse parity-check matrix; Artificial intelligence; Bismuth; Channel capacity; Equations; Error correction; Iterative decoding; Linear code; Parity check codes; Sparse matrices; Voting;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365137
Filename
1365137
Link To Document