Improved error bounds for the erasure/list scheme: the binary and spherical cases
classification
💻 cs.IT
math.IT
keywords
erasurebinaryboundscodeserrorimprovedlistscheme
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.