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

TL;DR

This paper presents enhanced error and erasure bounds for spherical and binary linear codes using Forney's erasure/list decoding scheme, advancing the theoretical understanding of decoding performance.

Contribution

It provides improved bounds on error and erasure rates specifically for spherical and binary codes, expanding previous theoretical results.

Findings

Derived tighter bounds on error rates for spherical codes

Established improved erasure bounds for binary linear codes

Proved related theoretical results on decoding performance

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.