Metraipolis › archive › dc_7a8a7ffec051
An Ordered-Reliability-Bits Chase Decoding Algorithm for BCH Codes — arXiv:2608.05591
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.05591
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-28T03:04:08.264Z
- SHA-256 of the archived text
d30b2652c407cf5a2b5d47386d9c4f901b4a199fae8e9b1723f6851f7ba5a41d- Stable URL of this page
https://metraipolis.com/documento/dc_7a8a7ffec051
How to cite
An Ordered-Reliability-Bits Chase Decoding Algorithm for BCH Codes — arXiv:2608.05591 — arXiv (en), https://arxiv.org/abs/2608.05591 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7a8a7ffec051 (Metraipolis archive dc_7a8a7ffec051, sha256 d30b2652c407cf5a2b5d47386d9c4f901b4a199fae8e9b1723f6851f7ba5a41d)
BibTeX
@misc{dc7a8a7ffec051,
title = {An Ordered-Reliability-Bits Chase Decoding Algorithm for BCH Codes — arXiv:2608.05591},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.05591},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7a8a7ffec051; sha256 d30b2652c407cf5a2b5d47386d9c4f901b4a199fae8e9b1723f6851f7ba5a41d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.05591. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this paper, we propose a low-complexity ordered-reliability-bits Chase (ORB-Chase) decoding algorithm for BCH codes. The proposed algorithm differs from the traditional Chase algorithm in two key aspects. First, it employs the logical weight as a metric to generate test error patterns (TEPs). Second, it introduces an integer-based early termination criterion that ensures computation can stop at the earliest possible stage if the maximum-likelihood codeword is identified, thereby minimizing unnecessary computational effort. Simulation results for (127, 113, 5) BCH codes and (256, 239, 6) eBCH codes demonstrate that the ORB-Chase algorithm achieves near-ML performance with significantly fewer test patterns compared to the Chase algorithm. Moreover, the average number of Berlekamp-Massey (BM) decoding calls decreases rapidly as $E_b / N_0$ increases, achieving a reduction of up to 98.1% compared to the Chase algorithm at the same BLER performance. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-07 in math.IT). Categorie arXiv: Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2608.05591 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-28T03:02:08.396Z dalla pagina https://arxiv.org/catchup/math.IT/2026-08-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).