DocumentCode
2602536
Title
An improved sphere-packing bound for finite-length codes over symmetric memoryless channels
Author
Wiechman, Gil ; Sason, Igal
Author_Institution
Dept. of Electr. Eng., Technion - Israel Inst. of Technol., Haifa
fYear
2008
fDate
Jan. 27 2008-Feb. 1 2008
Firstpage
320
Lastpage
325
Abstract
We present an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes are decoded by an arbitrary list decoder. Some applications of the ISP bound are also exemplified. Its tightness under maximum-likelihood (ML) decoding is studied by comparing the ISP bound to previously reported upper and lower bounds on the ML decoding error probability, and also to computer simulations of iteratively decoded turbo-like codes.
Keywords
channel coding; error correction codes; maximum likelihood decoding; memoryless systems; ISP bound; arbitrary list decoder; finite-length error-correcting codes; maximum-likelihood decoding; sphere packing bound; symmetric memoryless channels; AWGN channels; Block codes; Channel capacity; Error correction codes; Error probability; Gas insulated transmission lines; Iterative decoding; Maximum likelihood decoding; Memoryless systems; Sections;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and Applications Workshop, 2008
Conference_Location
San Diego, CA
Print_ISBN
978-1-4244-2670-6
Type
conf
DOI
10.1109/ITA.2008.4601067
Filename
4601067
Link To Document