A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code

Anais da Academia Brasileira de Ciências

Tariq Shah¹  Mubashar Khan¹  Antonio A. De Andrade¹ 

关键词: BCH code;    binary cyclic code;    binary Hamming code;    decoding algorithm;    Código BCH;    código cíclico binário;    código de Hamming binário;    algoritmo de decodificação;   

DOI  :  10.1590/S0001-37652013000300002

来源: SciELO

【 摘 要 】

For a given binary BCH code Cn of length n = 2s - 1 generated by a polynomialof degree r there is no binary BCH code of length (n + 1)n generated by a generalized polynomialof degree 2r. However, it does exist a binary cyclic code C(n+1)n of length (n + 1)n such that the binary BCH code Cn is embedded in C(n+1)n. Accordingly a high code rate is attained through a binary cyclic code C(n+1)n for a binary BCH code Cn. Furthermore, an algorithm proposed facilitates in a decoding of a binary BCH code Cn through the decoding of a binary cyclic code C(n+1)n, while the codes Cn and C(n+1)n have the same minimum hamming distance.

【 授权许可】

CC BY   
 All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License