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

Bibliographic Details
Main Author: SHAH,TARIQ
Publication Date: 2013
Other Authors: KHAN,MUBASHAR, ANDRADE,ANTONIO A. DE
Format: Article
Language: eng
Source: Anais da Academia Brasileira de Ciências (Online)
Download full: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0001-37652013000300863
Summary: 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.
id ABC-1_19c5511e15f5089f6f7421606f47be1c
oai_identifier_str oai:scielo:S0001-37652013000300863
network_acronym_str ABC-1
network_name_str Anais da Academia Brasileira de Ciências (Online)
repository_id_str
spelling A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic codeBCH codebinary cyclic codebinary Hamming codedecoding algorithmFor 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.Academia Brasileira de Ciências2013-09-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0001-37652013000300863Anais da Academia Brasileira de Ciências v.85 n.3 2013reponame:Anais da Academia Brasileira de Ciências (Online)instname:Academia Brasileira de Ciências (ABC)instacron:ABC10.1590/S0001-37652013000300002info:eu-repo/semantics/openAccessSHAH,TARIQKHAN,MUBASHARANDRADE,ANTONIO A. DEeng2015-10-26T00:00:00Zoai:scielo:S0001-37652013000300863Revistahttp://www.scielo.br/aabchttps://old.scielo.br/oai/scielo-oai.php||aabc@abc.org.br1678-26900001-3765opendoar:2015-10-26T00:00Anais da Academia Brasileira de Ciências (Online) - Academia Brasileira de Ciências (ABC)false
dc.title.none.fl_str_mv A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code
title A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code
spellingShingle A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code
SHAH,TARIQ
BCH code
binary cyclic code
binary Hamming code
decoding algorithm
title_short A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code
title_full A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code
title_fullStr A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code
title_full_unstemmed A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code
title_sort A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code
author SHAH,TARIQ
author_facet SHAH,TARIQ
KHAN,MUBASHAR
ANDRADE,ANTONIO A. DE
author_role author
author2 KHAN,MUBASHAR
ANDRADE,ANTONIO A. DE
author2_role author
author
dc.contributor.author.fl_str_mv SHAH,TARIQ
KHAN,MUBASHAR
ANDRADE,ANTONIO A. DE
dc.subject.por.fl_str_mv BCH code
binary cyclic code
binary Hamming code
decoding algorithm
topic BCH code
binary cyclic code
binary Hamming code
decoding algorithm
description 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.
publishDate 2013
dc.date.none.fl_str_mv 2013-09-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0001-37652013000300863
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0001-37652013000300863
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/S0001-37652013000300002
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv text/html
dc.publisher.none.fl_str_mv Academia Brasileira de Ciências
publisher.none.fl_str_mv Academia Brasileira de Ciências
dc.source.none.fl_str_mv Anais da Academia Brasileira de Ciências v.85 n.3 2013
reponame:Anais da Academia Brasileira de Ciências (Online)
instname:Academia Brasileira de Ciências (ABC)
instacron:ABC
instname_str Academia Brasileira de Ciências (ABC)
instacron_str ABC
institution ABC
reponame_str Anais da Academia Brasileira de Ciências (Online)
collection Anais da Academia Brasileira de Ciências (Online)
repository.name.fl_str_mv Anais da Academia Brasileira de Ciências (Online) - Academia Brasileira de Ciências (ABC)
repository.mail.fl_str_mv ||aabc@abc.org.br
_version_ 1754302859234508800