Improved error bounds for the erasure/list scheme: the binary and spherical cases

  • Authors:

  • A. Barg

  • Affiliations:

  • Dept. of Electr. & Comput. Eng., Univ. of Maryland, College Park, MD, USA

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.90

Visualization

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.