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

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

2004-07-04

arxiv.org/abs/cs/0407010v1

IEEE Transactions on Informatin Theory, vol. 50, no. 10, 2004, pp. 2503-2511

Computer Science

Information Theory

18 pages, 3 figures. Submitted to IEEE Transactions on Informatin Theory in May 2001, will appear in Oct. 2004 (tentative)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Improved error bounds for the erasure/list scheme: the binary and spherical cases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improved error bounds for the erasure/list scheme: the binary and spherical cases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved error bounds for the erasure/list scheme: the binary and spherical cases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-72683