article · IEEE Transactions on Information Theory · 2022
On Decoding Binary Quasi-Reversible BCH Codes
Tsung‐Ching Lin, Chong‐Dao Lee, Yaotsu Chang, Trieu‐Kien Truong
Cited by 2Abstract and details only
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.
Cite this paper
Lin, T., Lee, C., Chang, Y., & Truong, T. (2022). On Decoding Binary Quasi-Reversible BCH Codes. IEEE Transactions on Information Theory, 68(5), 3034–3046. https://doi.org/10.1109/tit.2022.3142371
Lin, Tsung‐Ching, et al. “On Decoding Binary Quasi-Reversible BCH Codes.” IEEE Transactions on Information Theory, vol. 68, no. 5, 2022, pp. 3034–46, https://doi.org/10.1109/tit.2022.3142371.
Lin, Tsung‐Ching, Chong‐Dao Lee, Yaotsu Chang, and Trieu‐Kien Truong. 2022. “On Decoding Binary Quasi-Reversible BCH Codes.” IEEE Transactions on Information Theory 68 (5): 3034–46. https://doi.org/10.1109/tit.2022.3142371.
Lin, T. et al. (2022) ‘On Decoding Binary Quasi-Reversible BCH Codes’, IEEE Transactions on Information Theory, 68(5), pp. 3034–3046. Available at: https://doi.org/10.1109/tit.2022.3142371.
@article{lin2022decoding,
title = {{On Decoding Binary Quasi-Reversible BCH Codes}},
author = {Lin, Tsung‐Ching and Lee, Chong‐Dao and Chang, Yaotsu and Truong, Trieu‐Kien},
journal = {IEEE Transactions on Information Theory},
volume = {68},
number = {5},
pages = {3034--3046},
year = {2022},
doi = {10.1109/tit.2022.3142371}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Decoding beyond the BCH bound (Corresp.)
Carlos R. P. Hartmann · IEEE Transactions on Information Theory · 1972
Cited by 43
Research of modified IRA decoding algorithm based on offset approximation
Tian Zhang · Microcomputer & its Applications · 2009
Cited by 0
Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)
Carlos R. P. Hartmann, Kenneth K. Tzeng · IEEE Transactions on Information Theory · 1974
Cited by 23
A Modified BP Decoding Algorithm of LDPC Codes
Zhan Yi · Science Technology and Engineering · 2013
Cited by 0
Iterative Soft-Decision Decoding of Hermitian Codes
Li Chen · IEEE Transactions on Communications · 2012
Cited by 4
A New Procedure for Decoding Cyclic and Bch Codes Up to Actual Minimum Distance
G.L. Feng, Kenneth K. Tzeng · IEEE International Symposium on Information Theory (ISIT) · 2005
Cited by 4
Two new decoding algorithms for Reed-Solomon codes
Tomik Yaghoobian, Ian F. Blake · Applicable Algebra in Engineering Communication and Computing · 1994
Cited by 5