|
|||||
|
|
On algebraic decoding of the Z4-linear Goethals-likecodes |
|
| Authors: | Ranto K |
| Affiliation: | Turku Centre for Comput. Sci.; |
| Abstract: | The Z4-linear Goethals-like code of length 2m has 22m+1-3m-2 codewords and minimum Lee distance 8 for any odd integer m⩾3. We present an algebraic decoding algorithm for all Z4-linear Goethals-like codes Ck introduced by Helleseth et al.(1995, 1996). We use Dickson polynomials and their properties to solve the syndrome equations |
| Keywords: | |