Publication
Construction and decoding of BCH codes over finite commutative rings
| Summary: | 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. |
|---|---|
| Main Authors: | De Andrade, Antonio Aparecido |
| Other Authors: | Palazzo Jr., Reginaldo |
| Subject: | BCH codes Error-location numbers Forney's method Galois extension Modified Berlekamp-Massey algorithm Syndrome calculation |
| Year: | 2014 |
| Country: | Brazil |
| Document type: | article |
| Access type: | open access |
| Associated institution: | IBICT |
| Language: | English |
| Origin: | Oasisbr |
| Summary: | 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. |
|---|
Funded activities
No funded projects found.