Construction and decoding of BCH codes over finite commutative rings
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 Ber...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 1999 |
| País: | Brasil |
| Recursos: | Universidade Estadual Paulista (UNESP) |
| Repositorio: | Repositório Institucional da UNESP |
| Idioma: | inglés |
| OAI Identifier: | oai:repositorio.unesp.br:11449/65680 |
| Acesso em linha: | http://dx.doi.org/10.1016/S0024-3795(98)10163-5 http://hdl.handle.net/11449/65680 |
| Access Level: | acceso abierto |
| Palavra-chave: | BCH codes Error-location numbers Forney's method Galois extension Modified Berlekamp-Massey algorithm Syndrome calculation |
| Resumo: | 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. |
|---|