Improved error bounds for the erasure/list scheme: the binary and spherical cases
Information Theory
2016-11-17 v1 math.IT
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.
Cite
@article{arxiv.cs/0407010,
title = {Improved error bounds for the erasure/list scheme: the binary and spherical cases},
author = {Alexander Barg},
journal= {arXiv preprint arXiv:cs/0407010},
year = {2016}
}
Comments
18 pages, 3 figures. Submitted to IEEE Transactions on Informatin Theory in May 2001, will appear in Oct. 2004 (tentative)