Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Decision Support Systems

Encoding and decoding of BCH codes using light and short codewords

Computer Science

Published Jun 1, 1988• 0 citations
Publisher
DOI
10.1016/0167-9236(88)90145-5

Related papers

On Iterative Decoding of Bch Codes and Decoding Beyond the Bch Bound

Kenneth K. Tzeng

•Jan 1, 1969•3 citations

A Novel Coding Scheme for Encoding and Iterative Soft-Decision Decoding of Binary BCH Codes of Prime Lengths

Shu Lin, Khaled Abdel-Ghaffar, Juane Li +1 more

A novel coding scheme is presented for encoding and iterative soft-decision decoding of binary BCH codes of prime lengths. The encoding of such a BCH code is performed on a collection of codewords which are mapped through Galois Fourier transform into a codeword of a nonbinary low-density parity-check (LDPC) code which has a binary parity-check matrix for transmission. Using this matrix, a binary iterative soft-decision decoding algorithm based on belief-propagation is applied to jointly decode a collection of codewords of the BCH code. The joint-decoding allows information sharing among the received vectors corresponding to the codewords in the collection during the iterative decoding process. For decoding a BCH code of prime length, the proposed decoding scheme not only requires low decoding complexity, but also yields superior performance. The proposed decoding scheme can achieve a joint-decoding gain over the maximum likelihood decoding of individual codewords.

Information Theory and Applications Workshop (ITA)•Feb 1, 2018•0 citations

Iterative decoding of short BCH codes and its post-processing

Guangwen Li, Xiao Yu

Effective iterative decoding of short BCH codes faces two primary challenges: identifying an appropriate parity-check matrix and accelerating decoder convergence. To address these issues, we propose a systematic scheme to derive an optimized parity-check matrix through a heuristic approach. This involves a series of binary sum and row shift operations, resulting in a low-density, quasi-regular column weight distribution with a reduced number of shortest cycles in the underlying redundant Tanner graph. For the revised normalized min-sum decoder, we concurrently integrate three types of random permutations into the alternated messages across iterations, leading to significantly faster convergence compared to existing methods. Furthermore, by utilizing the iterative trajectories of failed normalized min-sum decoding, we enhance the reliability measurement of codeword bits with the assistance of a neural network model from prior work, which accommodates more failures for the post-processing of ordered statistics decoding. Additionally, we report the types of undetected errors for the design of iterative decoders for short BCH codes, which potentially challenge efforts to approach the maximum likelihood limit. Extensive simulations demonstrate that the proposed hybrid framework achieves an attractive balance between performance, latency, and complexity.

arXiv:2411.13876•Nov 21, 2024•1 citation

On classical BCH codes and quantum BCH codes

XU Ya-jie, Zhi Ma, Chunyuan Zhang

Journal of Electronics (China)•Jan 1, 2009•2 citations

Two families of BCH codes and new quantum codes

Hao Song, Ruihu Li, Junli Wang +1 more

Quantum Information Processing•Sep 3, 2018•17 citations

Multiple-Cyclic-Basis GCD for BCH Codes

Yiwen Wang, Qianfan Wang, Jifan Liang +2 more

In this paper, we propose a Gaussian-elimination-free (GE-free) multiple-cyclic-basis guessing codeword decoding (MCB-GCD) algorithm for BCH codes. Unlike conventional ordered statistics decoding (OSD), which selects a single most reliable basis via GE, MCB-GCD employs multiple cyclic bases, each consisting of k consecutive bits that serve as the re-encoding basis. By leveraging the cyclic structure of BCH codes, the proposed algorithm completely eliminates online GE and supports parallel list decoding through multiple re-encoding bases. A local-constraint (LC) mechanism together with trivial and dynamic approximate ideal (DAI) stopping criteria is employed to reduce the average number of searches. We prove that, with unlimited searches and tailored early stopping, the proposed algorithm is a non-exhaustive-search ML decoding algorithm. Furthermore, a saddlepoint-based numerical method is derived to estimate the upper bound on frame error rate (FER) and the average number of searches for the proposed decoding algorithm, confirming that MCB-GCD closely approaches maximum-likelihood (ML) performance with dramatically reduced average number of searches. Simulation results over BPSK-AWGN channels demonstrate that the BCH codes decoded by the proposed MCB-GCD closely approach the finite-length capacity across all supported code rates, while outperforming that with OSD, GCD and LC-GCD under certain parameters.

International Conference on Communications•May 24, 2026•0 citations
A novel coding scheme is presented for encoding and iterative soft-decision decoding of binary BCH codes of prime lengths. The encoding of such a BCH code is performed on a collection of codewords which are mapped through Galois Fourier transform into a codeword of a nonbinary low-density parity-check (LDPC) code which has a binary parity-check matrix for transmission. Using this matrix, a binary iterative soft-decision decoding algorithm based on belief-propagation is applied to jointly decode a collection of codewords of the BCH code. The joint-decoding allows information sharing among the received vectors corresponding to the codewords in the collection during the iterative decoding process. For decoding a BCH code of prime length, the proposed decoding scheme not only requires low decoding complexity, but also yields superior performance. The proposed decoding scheme can achieve a joint-decoding gain over the maximum likelihood decoding of individual codewords.
Effective iterative decoding of short BCH codes faces two primary challenges: identifying an appropriate parity-check matrix and accelerating decoder convergence. To address these issues, we propose a systematic scheme to derive an optimized parity-check matrix through a heuristic approach. This involves a series of binary sum and row shift operations, resulting in a low-density, quasi-regular column weight distribution with a reduced number of shortest cycles in the underlying redundant Tanner graph. For the revised normalized min-sum decoder, we concurrently integrate three types of random permutations into the alternated messages across iterations, leading to significantly faster convergence compared to existing methods. Furthermore, by utilizing the iterative trajectories of failed normalized min-sum decoding, we enhance the reliability measurement of codeword bits with the assistance of a neural network model from prior work, which accommodates more failures for the post-processing of ordered statistics decoding. Additionally, we report the types of undetected errors for the design of iterative decoders for short BCH codes, which potentially challenge efforts to approach the maximum likelihood limit. Extensive simulations demonstrate that the proposed hybrid framework achieves an attractive balance between performance, latency, and complexity.
In this paper, we propose a Gaussian-elimination-free (GE-free) multiple-cyclic-basis guessing codeword decoding (MCB-GCD) algorithm for BCH codes. Unlike conventional ordered statistics decoding (OSD), which selects a single most reliable basis via GE, MCB-GCD employs multiple cyclic bases, each consisting of k consecutive bits that serve as the re-encoding basis. By leveraging the cyclic structure of BCH codes, the proposed algorithm completely eliminates online GE and supports parallel list decoding through multiple re-encoding bases. A local-constraint (LC) mechanism together with trivial and dynamic approximate ideal (DAI) stopping criteria is employed to reduce the average number of searches. We prove that, with unlimited searches and tailored early stopping, the proposed algorithm is a non-exhaustive-search ML decoding algorithm. Furthermore, a saddlepoint-based numerical method is derived to estimate the upper bound on frame error rate (FER) and the average number of searches for the proposed decoding algorithm, confirming that MCB-GCD closely approaches maximum-likelihood (ML) performance with dramatically reduced average number of searches. Simulation results over BPSK-AWGN channels demonstrate that the BCH codes decoded by the proposed MCB-GCD closely approach the finite-length capacity across all supported code rates, while outperforming that with OSD, GCD and LC-GCD under certain parameters.