On the Error Rate of Binary BCH Codes under Error-and-erasure Decoding
Information Theory
2026-01-29 v2 math.IT
Abstract
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.
Cite
@article{arxiv.2509.24794,
title = {On the Error Rate of Binary BCH Codes under Error-and-erasure Decoding},
author = {Sisi Miao and Jonathan Mandelbaum and Holger Jäkel and Laurent Schmalen},
journal= {arXiv preprint arXiv:2509.24794},
year = {2026}
}
Comments
International Zurich Seminar (IZS) 2026