Artin-Schreier curves and weights of two dimensional cyclic codes
Güneri, Cem (2004) Artin-Schreier curves and weights of two dimensional cyclic codes. Finite Fields and Their Applications, 10 (4). pp. 481-505. ISSN 1071-5797
This is the latest version of this item.
Official URL: http://dx.doi.org/10.1016/j.ffa.2003.10.002
Let GF(q) be the finite field with q elements of characteristic p, GF(q^m) be the extension of degree m>1 and f(x) be a polynomial over GF(q^m). We determine a necessary and sufficient condition for y^q-y=f(x) to have the maximum number of affine GF(qm)-rational points. Then we study the weights of 2-D cyclic codes. For this, we give a trace representation of the codes starting with the zeros of the dual 2-D cyclic code. This leads to a relation between the weights of codewords and a family of Artin-Schreier curves.We give a lower bound on the minimum distance for a large class of 2-D cyclic codes. Then we look at some special classes that are not covered by our main result and obtain similar minimum distance bounds.
Available Versions of this Item
Repository Staff Only: item control page