DocumentCode
2622615
Title
Trace description of q-ary linear codes
Author
Zanotti, J.-P.
Author_Institution
GECT, Toulon Univ., La Garde, France
fYear
1994
fDate
27 Jun-1 Jul 1994
Firstpage
45
Abstract
J. Wolfmann (see A.A.E.C.C., vol.2, p.119, 1991) gives a description of projective binary linear codes by means of a polynomial. The purpose of our work is first to generalize such a description to q-ary codes. Then the main difficulty is to evaluate the weights of these codes and it is not possible to follow the same method as in the binary case. We consider Artin-Schreier curves and we give a bound on weights. Some normalization are also investigated
Keywords
linear codes; polynomials; Artin-Schreier curves; code weights; normalization; polynomial; projective binary linear codes; q-ary linear codes; trace description; weights bound; Computer aided software engineering; Equations; Galois fields; Instruction sets; Linear code; Polynomials; Reactive power;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location
Trondheim
Print_ISBN
0-7803-2015-8
Type
conf
DOI
10.1109/ISIT.1994.394926
Filename
394926
Link To Document