DocumentCode
3279727
Title
Kovalenko´s full-rank limit and overheads as lower bounds of error-performances of LDPC and LT codes over binary erasure channels
Author
Lee, Ki-Moon ; Radha, Hayder ; Kim, Beom-Jin ; Song, Hong-Yeop
Author_Institution
Dept of Inf. & Commun. Eng., Sungkyunkwan Univ., Suwon
fYear
2008
fDate
7-10 Dec. 2008
Firstpage
1
Lastpage
5
Abstract
We present Kovalenko´s full-rank limit as a tight probabilistic lower bound for error performances of LDPC codes and LT codes over BEC. From the limit, we derive a full-rank overhead as a tight lower-bound for stable overheads for successful maximum-likelihood decoding of the codes.
Keywords
binary codes; channel coding; maximum likelihood decoding; parity check codes; probability; transform coding; Kovalenko full-rank limit; LDPC code; LT code; Luby transform code; binary erasure channel; error performance; maximum-likelihood decoding; probabilistic lower bound; Belief propagation; Computer errors; IP networks; Information theory; Kernel; Linear systems; Maximum likelihood decoding; Message passing; Parity check codes; Solitons;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and Its Applications, 2008. ISITA 2008. International Symposium on
Conference_Location
Auckland
Print_ISBN
978-1-4244-2068-1
Electronic_ISBN
978-1-4244-2069-8
Type
conf
DOI
10.1109/ISITA.2008.4895488
Filename
4895488
Link To Document