Alternant and BCH codes over certain rings
| Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
|---|---|
| Data(s) |
20/05/2014
20/05/2014
01/01/2003
|
| Resumo |
Alternant codes over arbitrary finite commutative local rings with identity are constructed in terms of parity-check matrices. The derivation is based on the factorization of x s - 1 over the unit group of an appropriate extension of the finite ring. An efficient decoding procedure which makes use of the modified Berlekamp-Massey algorithm to correct errors and erasures is presented. Furthermore, we address the construction of BCH codes over Zm under Lee metric. |
| Formato |
233-247 |
| Identificador |
http://dx.doi.org/10.1590/S0101-82052003000200005 Computational & Applied Mathematics. Sociedade Brasileira de Matemática Aplicada e Computacional, v. 22, n. 2, p. 233-247, 2003. 1807-0302 http://hdl.handle.net/11449/22134 10.1590/S0101-82052003000200005 S1807-03022003000200005 S1807-03022003000200005.pdf |
| Idioma(s) |
eng |
| Publicador |
Sociedade Brasileira de Matemática Aplicada e Computacional |
| Relação |
Computational & Applied Mathematics |
| Direitos |
openAccess |
| Palavras-Chave | #codes over rings #Alternant code #BCH codes #Galois extensions of local commutative rings #algebraic decoding #modified Berlekamp-Massey algorithm #errors and erasures decoding #Lee metric |
| Tipo |
info:eu-repo/semantics/article |
