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.
We study relationships between worst-case and random-noise properties of error correcting codes. More concretely, we consider connections between minimum distance, list decoding radius, and block error probability on noisy channels. A recent result of Pernice, Sprumont, and Wootters established the tight connection between list decoding radius and symmetric channel performance for linear codes. We extend this result to general codes. The proof proceeds by directly bounding the weight distribution rather than by sharp threshold techniques. We then turn to the relation between minimum distance and symmetric channel performance. The results we just described imply that a q-ary code of relative distance δ has vanishing error probability on the symmetric channel up to the Johnson radius Jq(δ). We improve upon this bound in the case of linear codes, for a range δ, for q≥4. In our proof we consider the \emph{erasure} properties of codes, and bound their weight distribution through inequalities introduced by Samorodnitsky. The latter part of the proof gives a more general technique that bounds the symmetric channel performance of a linear code with constant relative distance and good erasure channel performance.
Determining the exact decoding error probability of linear block codes is an interesting problem. For binary BCH codes, McEliece derived methods to estimate the error probability of a simple bounded distance decoding (BDD) for BCH codes. However, BDD falls short in many applications. In this work, we consider error-and-erasure decoding and its improved variants. We derive closed-form expressions for their error probabilities and validate them through simulations. Then, we illustrate their use in assessing concatenated coding schemes.
In this work we introduce a framework to study the trade-off between the undetected error rate (UER) and overall frame error rate (FER) of CRC-concatenated polar codes in the short blocklength regime. Three approaches to improve the tradeoff under successive cancellation list (SCL) decoding are outlined. Two techniques are based on the optimum threshold test introduced by Forney in 1968, whereas a third technique partitions the CRC code parity bits in two sets, where one set is used to prune the SCL decoder list, and the other set is used for error detection. The performance of the three schemes is analyzed via Monte Carlo simulations, and compared with a finite-length achievability bound based on Forney's random coding bound.