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 decodingalgorithm of this code is presented.
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 decodingalgorithm of this code is presented.
A step-by-step decoding algorithm is presented for double-error-correcting binary BCH codes of length n = 2(m) - 1. The decodingalgorithm can directly determine whether any received bit is correct or not without know...
详细信息
A step-by-step decoding algorithm is presented for double-error-correcting binary BCH codes of length n = 2(m) - 1. The decodingalgorithm can directly determine whether any received bit is correct or not without knowing the number of errors which have occurred in the received vector and also without determining the corresponding error location polynomial. The merits of the hardware decoder based on the algorithm are that it is very simple and fast. In addition, it is suitable for decoding long block codes.
暂无评论