| dc.contributor | Universidade Estadual Paulista (UNESP) | |
| dc.creator | Andrade, Antonio Aparecido de | |
| dc.creator | Shah, Tariq | |
| dc.creator | Khan, Mubashar | |
| dc.date | 2015-04-27T11:55:36Z | |
| dc.date | 2016-10-25T20:46:04Z | |
| dc.date | 2015-04-27T11:55:36Z | |
| dc.date | 2016-10-25T20:46:04Z | |
| dc.date | 2014 | |
| dc.date.accessioned | 2017-04-06T08:06:00Z | |
| dc.date.available | 2017-04-06T08:06:00Z | |
| dc.identifier | International Journal of Algebra, v. 8, n. 11, p. 547-556, 2014. | |
| dc.identifier | 1312-8868 | |
| dc.identifier | http://hdl.handle.net/11449/122329 | |
| dc.identifier | http://acervodigital.unesp.br/handle/11449/122329 | |
| dc.identifier | http://dx.doi.org/10.12988/ija.2014.4657 | |
| dc.identifier | ISSN1312-8868-2014-08-11-547-556.pdf | |
| dc.identifier | 8940498347481982 | |
| dc.identifier | http://www.m-hikari.com/ija/ija-2014/ija-9-12-2014/index.html | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/932953 | |
| dc.description | This study establishes that for a given binary BCH code C0 n of length n generated by a polynomial g(x) ∈ F2[x] of degree r there exists a family of binary cyclic codes {Cm 2m−1(n+1)n}m≥1 such that for each m ≥ 1, the binary cyclic code Cm 2m−1(n+1)n has length 2m−1(n + 1)n and is generated by a generalized polynomial g(x 1 2m ) ∈ F2[x, 1 2m Z≥0] of degree 2mr. Furthermore, C0 n is embedded in Cm 2m−1(n+1)n and Cm 2m−1(n+1)n is embedded in Cm+1 2m(n+1)n for each m ≥ 1. By a newly proposed algorithm, codewords of the binary BCH code C0 n can be transmitted with high code rate and decoded by the decoder of any member of the family {Cm 2m−1(n+1)n}m≥1 of binary cyclic codes, having the same code rate. | |
| dc.language | eng | |
| dc.relation | International Journal of Algebra | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.subject | Cyclic code | |
| dc.subject | BCH code | |
| dc.subject | decoding procedure | |
| dc.title | A BCH code and a sequence of cyclic codes | |
| dc.type | Otro | |
