DocumentCode
1114938
Title
Improved error bounds for the erasure/list scheme: the binary and spherical cases
Author
Barg, Alexander
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Maryland, College Park, MD, USA
Volume
50
Issue
10
fYear
2004
Firstpage
2503
Lastpage
2514
Abstract
We derive improved bounds on the error and erasure rate for spherical codes and for binary linear codes under Forney´s erasure/list decoding scheme and prove some related results.
Keywords
Hamming codes; binary codes; decoding; error statistics; linear codes; Forney´s erasure-list decoding scheme; binary linear code; distance distribution; erasure rate; error bound; error exponent; error rate; spherical code; Algebra; Computer aided software engineering; Error analysis; Error probability; Gaussian channels; Information theory; Iterative decoding; Linear code; Maximum likelihood decoding; Turbo codes; Distance distribution; erasure/list decoding; error exponent; spherical codes;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2004.834753
Filename
1337127
Link To Document