1. On Decoding Binary Quasi-Reversible BCH Codes.
- Author
-
Lin, Tsung-Ching, Lee, Chong-Dao, Chang, Yaotsu, and Truong, Trieu-Kien
- Subjects
MATRIX multiplications ,LINEAR systems ,ERROR-correcting codes ,COMPUTATIONAL complexity ,DECODING algorithms ,COMPUTER simulation ,MATRIX decomposition - Abstract
For the recently developed quasi-reversible BCH codes with long lengths and high error-correcting capability, this paper is aimed at proposing a new and faster decoding procedure. It consists of four steps: 1) compute the consecutive syndromes; 2) calculate the syndrome functions by the forward and backward recursions; 3) solve a linear subsystem together with one matrix multiplication in order to find an error-locator polynomial; 4) determine the errors from the obtained polynomial by using the root-finding algorithm. This procedure, especially in Steps 2 and 3, differs greatly from the conventional procedures, which determine an error-locator polynomial directly from solving a linear system with the aid of the consecutive syndromes. The key idea behind this decoding technique is that the computational complexity of such a small subsystem instead of an originally large linear system can be significantly reduced, although there are additional forward and backward syndrome calculations with low complexity increasing. Finally, the illustrative examples and numerical simulations can be helpful to demonstrate the accuracy and efficacy of the presented decoding technique at different error-correcting capabilities. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF