On Step-by-Step Complete Decoding Triple-Error-Correcting Binary BCH Codes

  title={On Step-by-Step Complete Decoding Triple-Error-Correcting Binary BCH Codes},
  author={Shyue-Win Wei},
  journal={IEICE Trans. Fundam. Electron. Commun. Comput. Sci.},
  • Shyue-Win Wei
  • Published 1 November 2006
  • Computer Science
  • IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
According to the properties found in the algebraic complete decoding method for triple-error-correcting binary Bose-Chaudhuri-Hocquenghem (BCH) codes, a step-by-step complete decoding algorithm of this code is presented. 
4 Citations

Tables from this paper

A new step-by-step complete decoding algorithm for binary cyclic codes
A new step-by-step complete decoding algorithm for cyclic codes is proposed, based on a newly devised transfer function, that can achieve a better decoding efficiency than the Zero-Guards algorithm, while keeping a smaller number of vectors for most of thecyclic codes examined.
Application of Beyond Bound Decoding for High Speed Optical Communications
This hard-decision decoding method outperforms traditional minimum distance decoding method, with a total net coding gain of 10.36 dB, for high speed optical communications.
Adaptive Security And Reliability Using Linear Erasure Correction Codes
This study introduces a novel scientific foundation to manage security and reliability in resource scarce environments such as wireless edge networks. We present encryption techniques based on


On the undetected error probability of triple-error-correcting BCH codes
The probability of undetected error P/sub u/( epsilon ) for the primitive triple-error-correcting BCH codes of blocklength 2/sup m/-1 used solely for error detection on a binary symmetric channel
A note on the decoding of double-error-correcting binary BCH codes of primitive length (Corresp.)
In this correspondence a complete decoding algorithm for double-error-correcting binary BCH codes of length n = 2^m - 1 is introduced, based on the step-by-step decoding algorithm introduced by Prange and the decoding algorithms introduced by Meggitt, which makes use of the cyclic properties of the code.
Complete decoding of triple-error-correcting binary BCH codes
An extensive study of binary triple-error-correcting codes of primitive length n = 2^{m} - 1 is reported that results in a complete decoding algorithm whenever the maximum coset weight W_{max} is
An algebraic procedure for decoding beyond eBCH
  • J. Nilsson
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1996
The method can be seen as an extension of the step-by-step decoder introduced by Massey (1965) for BCH codes and considers the decoding of binary cyclic codes.
A high-speed real-time binary BCH decoder
A high-speed real-time decoder for t-error-correcting binary BCH codes based on a modified step-by-step decoding algorithm is presented and the circuit complexity can be made much less than that of the standard algebraic method.
Step-by-step decoding of the Bose-Chaudhuri- Hocquenghem codes
  • J. Massey
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1965
A new and conceptually simple decoding procedure is developed for all of the cyclic Bose-Chaudhuri-Hocquenghem codes and any pattern of t or fewer errors can be corrected in a step-by-step manner using this procedure.
Algebraic coding theory
  • E. Berlekamp
  • Computer Science
    McGraw-Hill series in systems science
  • 1968
This is the revised edition of Berlekamp's famous book, "Algebraic Coding Theory," originally published in 1968, wherein he introduced several algorithms which have subsequently dominated engineering
Error-correcting Codes
It is said that V is in standard form if V = (IdP ) for a matrix P , that is vij = δij , for i, j = 1, . . . , d (where δija = 0, i 6= j, δii = 1).
VLSI architectures for computing exponentiations, multiplicative inverses, and divisions in GF(2/sup m/)
  • Shyue-Win Wei
  • Computer Science
    Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94
  • 1994
A systolic power-sum circuit designed to perform AB/sup 2/+C computation in the finite field GF(2/sup m/) has been presented recently and a VLSI architecture for performing exponentiations in GF (2/Sup m/) is developed and two modified architectures that can be used to compute multiplicative inverses and divisions in GF( 2/supm/) are proposed respectively.
Algebraic Coding Theory, McGraw-Hill
  • New York,
  • 1968