Improved error bounds for the erasure/list scheme: the binary and spherical cases
<|reference_start|>Improved error bounds for the erasure/list scheme: the binary and spherical cases: 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.<|reference_end|>
@article{barg2004improved,
    title={Improved error bounds for the erasure/list scheme: the binary and
  spherical cases},
    author={Alexander Barg},
    journal={IEEE Transactions on Informatin Theory, vol. 50, no. 10, 2004, pp.
  2503-2511},
    year={2004},
    doi={10.1109/TIT.2004.834753},
    archivePrefix={arXiv},
    eprint={cs/0407010},
    primaryClass={cs.IT math.IT}
}