Publication
Alternant and BCH codes over certain rings
| Summary: | 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. |
|---|---|
| Main Authors: | Andrade,A.A. |
| Other Authors: | Interlando,J.C.; Palazzo Jr.,R. |
| Subject: | codes over rings alternant codes BCH codes Galois extensions of local commutative rings algebraic decoding modified Berlekamp-Massey algorithm errors and erasures decoding Lee metric |
| Year: | 2003 |
| Country: | Brazil |
| Document type: | article |
| Access type: | open access |
| Associated institution: | IBICT |
| Language: | English |
| Origin: | Oasisbr |
| Summary: | 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. |
|---|
Funded activities
No funded projects found.