| dc.contributor | Universidade Estadual Paulista (UNESP) | |
| dc.creator | De Andrade, Antonio Aparecido | |
| dc.creator | Palazzo Jr., Reginaldo | |
| dc.date | 2014-05-27T11:19:41Z | |
| dc.date | 2016-10-25T18:15:32Z | |
| dc.date | 2014-05-27T11:19:41Z | |
| dc.date | 2016-10-25T18:15:32Z | |
| dc.date | 1999-01-01 | |
| dc.date.accessioned | 2017-04-06T00:53:35Z | |
| dc.date.available | 2017-04-06T00:53:35Z | |
| dc.identifier | Linear Algebra and Its Applications, v. 286, n. 1-3, p. 69-85, 1999. | |
| dc.identifier | 0024-3795 | |
| dc.identifier | http://hdl.handle.net/11449/65680 | |
| dc.identifier | http://acervodigital.unesp.br/handle/11449/65680 | |
| dc.identifier | 10.1016/S0024-3795(98)10163-5 | |
| dc.identifier | WOS:000077665300005 | |
| dc.identifier | 2-s2.0-0039627876.pdf | |
| dc.identifier | 2-s2.0-0039627876 | |
| dc.identifier | http://dx.doi.org/10.1016/S0024-3795(98)10163-5 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/887376 | |
| dc.description | BCH codes over arbitrary finite commutative rings with identity are derived in terms of their locator vector. The derivation is based on the factorization of xs -1 over the unit ring of an appropriate extension of the finite ring. We present an efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, for these codes. The code construction and the decoding procedures are very similar to the BCH codes over finite integer rings. © 1999 Elsevier B.V. All rights reserved. | |
| dc.language | eng | |
| dc.relation | Linear Algebra and Its Applications | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.subject | BCH codes | |
| dc.subject | Error-location numbers | |
| dc.subject | Forney's method | |
| dc.subject | Galois extension | |
| dc.subject | Modified Berlekamp-Massey algorithm | |
| dc.subject | Syndrome calculation | |
| dc.title | Construction and decoding of BCH codes over finite commutative rings | |
| dc.type | Otro | |
