Please use this identifier to cite or link to this item:
http://acervodigital.unesp.br/handle/11449/65680- Title:
- Construction and decoding of BCH codes over finite commutative rings
- Universidade Estadual Paulista (UNESP)
- Universidade Estadual de Campinas (UNICAMP)
- 0024-3795
- 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.
- 1-Jan-1999
- Linear Algebra and Its Applications, v. 286, n. 1-3, p. 69-85, 1999.
- 69-85
- BCH codes
- Error-location numbers
- Forney's method
- Galois extension
- Modified Berlekamp-Massey algorithm
- Syndrome calculation
- http://dx.doi.org/10.1016/S0024-3795(98)10163-5
- Acesso aberto
- outro
- http://repositorio.unesp.br/handle/11449/65680
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.