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

Autor(es)

TARIQ SHAH ^[1] ; MUBASHAR KHAN ^[1] ; ANTONIO A. DE ANDRADE ^[2]

Afiliação do(s) autor(es)

^[1] Quaid I Azam Univ, Dept Math, Islamabad 45320 - Pakistan

^[2] Univ Estadual Paulista, IBILCE, Dept Matemat, BR-15054000 Sao Jose Do Rio Preto, SP - Brazil

• Tipo de documento: Artigo Científico
• Fonte: Anais da Academia Brasileira de Ciências; v. 85, n. 3, p. 863-872, 2013-09-00.

Resumo

For a given binary BCH code Cn of length n = 2s - 1 generated by a polynomial of degree r there is no binary BCH code of length (n + 1)n generated by a generalized polynomial of 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. (AU)

• Processo FAPESP: 11/03441-2 - Códigos e reticulados com aplicações
• Beneficiário: Antonio Aparecido de Andrade
• Modalidade de apoio: Auxílio à Pesquisa - Pesquisador Visitante - Internacional
• Processo FAPESP: 07/56052-8 - Teoria da informação e códigos
• Beneficiário: Sueli Irene Rodrigues Costa
• Modalidade de apoio: Auxílio à Pesquisa - Temático