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

Página do item simplificado
dc.contributor.authorShah, Tariq
dc.contributor.authorKhan, Mubashar
dc.contributor.authorDe Andrade, Antonio Aparecido [UNESP]
dc.contributor.institutionQuaid-i-Azam University
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-27T11:30:35Z
dc.date.available2014-05-27T11:30:35Z
dc.date.issued2013-09-01
dc.description.abstractFor a given binary BCH code Cn of length n = 2s-1 generated by a polynomial g(x)e{open}F2[x] of degree r there is no binary BCH code of length (n + 1)n generated by a generalized polynomial g(x1/2)e{open}F2[x1/2ℤ ≥ 0] 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.en
dc.description.affiliationDepartment of Mathematics Quaid-i-Azam University, 45320, Islamabad
dc.description.affiliationDepartamento de Matemática IBILCE Universidade Estadual Paulista 'Júlio de Mesquita Filho', Rua Cristóvão Colombo, 2265, Bairr Jardim Naz, 15054-000 São José do Rio Preto, SP
dc.description.affiliationUnespDepartamento de Matemática IBILCE Universidade Estadual Paulista 'Júlio de Mesquita Filho', Rua Cristóvão Colombo, 2265, Bairr Jardim Naz, 15054-000 São José do Rio Preto, SP
dc.description.sponsorshipFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.description.sponsorshipIdFAPESP: 07/56052-8
dc.description.sponsorshipIdFAPESP: 11/03441-2
dc.format.extent863-872
dc.identifierhttp://dx.doi.org/10.1590/S0001-37652013000300002
dc.identifier.citationAnais da Academia Brasileira de Ciencias, v. 85, n. 3, p. 863-872, 2013.
dc.identifier.doi10.1590/S0001-37652013000300002
dc.identifier.file2-s2.0-84884235776.pdf
dc.identifier.issn0001-3765
dc.identifier.issn1678-2690
dc.identifier.lattes8940498347481982
dc.identifier.scieloS0001-37652013000300002
dc.identifier.scieloS0001-37652013000300863
dc.identifier.scopus2-s2.0-84884235776
dc.identifier.urihttp://hdl.handle.net/11449/76462
dc.identifier.wosWOS:000324948400002
dc.language.isoeng
dc.relation.ispartofAnais da Academia Brasileira de Ciências
dc.relation.ispartofjcr0.956
dc.relation.ispartofsjr0,418
dc.relation.ispartofsjr0,418
dc.rights.accessRightsAcesso aberto
dc.sourceScopus
dc.subjectBCH code
dc.subjectBinary cyclic code
dc.subjectBinary Hamming code
dc.subjectDecoding algorithm
dc.titleA decoding method of an n length binary BCH code through (n + 1)n length binary cyclic codeen
dc.typeArtigo
dcterms.licensehttp://www.scielo.br/revistas/aabc/iaboutj.htm
unesp.author.lattes8940498347481982[3]
unesp.author.orcid0000-0001-6452-2236[3]
unesp.campusUniversidade Estadual Paulista (Unesp), Instituto de Biociências Letras e Ciências Exatas, São José do Rio Pretopt

Arquivos

Pacote Original
Agora exibindo 1 - 1 de 1
Imagem de Miniatura
Nome:
2-s2.0-84884235776.pdf
Tamanho:
14.1 MB
Formato:
Adobe Portable Document Format
Baixar

Coleções

Artigos - Matemática - IBILCE