| dc.contributor | Universidade Estadual Paulista (UNESP) | |
| dc.creator | Shah, Tariq | |
| dc.creator | Khan, Mubashar | |
| dc.creator | De Andrade, Antonio Aparecido | |
| dc.date | 2014-05-27T11:30:35Z | |
| dc.date | 2016-10-25T18:53:41Z | |
| dc.date | 2014-05-27T11:30:35Z | |
| dc.date | 2016-10-25T18:53:41Z | |
| dc.date | 2013-09-01 | |
| dc.date.accessioned | 2017-04-06T02:37:34Z | |
| dc.date.available | 2017-04-06T02:37:34Z | |
| dc.identifier | Anais da Academia Brasileira de Ciencias, v. 85, n. 3, p. 863-872, 2013. | |
| dc.identifier | 0001-3765 | |
| dc.identifier | 1678-2690 | |
| dc.identifier | http://hdl.handle.net/11449/76462 | |
| dc.identifier | http://acervodigital.unesp.br/handle/11449/76462 | |
| dc.identifier | 10.1590/S0001-37652013000300002 | |
| dc.identifier | S0001-37652013000300002 | |
| dc.identifier | S0001-37652013000300863 | |
| dc.identifier | WOS:000324948400002 | |
| dc.identifier | 2-s2.0-84884235776.pdf | |
| dc.identifier | 2-s2.0-84884235776 | |
| dc.identifier | http://dx.doi.org/10.1590/S0001-37652013000300002 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/897161 | |
| dc.description | For 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. | |
| dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
| dc.language | eng | |
| dc.relation | Anais da Academia Brasileira de Ciências | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.subject | BCH code | |
| dc.subject | Binary cyclic code | |
| dc.subject | Binary Hamming code | |
| dc.subject | Decoding algorithm | |
| dc.title | A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code | |
| dc.type | Otro | |
