Improved error bounds for the erasure/list scheme: the binary and spherical cases
arXiv:cs/0407010 · doi:10.1109/TIT.2004.834753
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.
18 pages, 3 figures. Submitted to IEEE Transactions on Informatin Theory in May 2001, will appear in Oct. 2004 (tentative)