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

DOI10.1590/S0001-37652013000300002zbMath1334.94103MaRDI QIDQ2863727

Mubashar Khan, Tariq Shah, Antonio Aparecido de Andrade

Publication date: 3 December 2013

Published in: Anais da Academia Brasileira de Ciências (Search for Journal in Brave)

Full work available at URL: http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0001-37652013000300863&lng=en&nrm=iso&tlng=en

zbMATH Keywords

decoding algorithmBCH codebinary cyclic codebinary Hamming code

Mathematics Subject Classification ID

Cyclic codes (94B15)

Related Items (2)

Primitive to non-primitive BCH codes: An instantaneous path shifting scheme for data transmission ⋮ Characterization of cyclic codes over {ℬ[X;(1/m)Z₀}_{m > 1}and efficient encoding decoding algorithm for cyclic codes]

Cites Work

• Encoding through generalized polynomial codes
• An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
• Generators and weights of polynomial codes
• Divisibility properties in semigroup rings
• Algorithms for computing parameters of graph-based extensions of BCH codes
• On the inherent intractability of certain coding problems (Corresp.)
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code