Surfaces and the weight distribution of a family of codes
Author:
- 1 July 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 43 (4) , 1354-1360
Abstract
We derive the weight distribution of the binary trace codes with words (Tr(axq+1+bx3+cx))x∈F*(q2) where a, b, c∈F(q2) and Tr is the trace map from F(q2) to F2. The weights of these words determine the exponential sums which were considered earlier by Moreno and Kumar (1994) and Lahtonen (1995). Results from the theory of quadratic forms play a role but the decisive argument is of an algebraic-geometric nature, namely, from the theory of surfacesKeywords
This publication has 6 references indexed in Scilit:
- Finite Fields1996
- Two remarks on a paper by Moreno and Kumar [binary Reed-Muller codes]IEEE Transactions on Information Theory, 1995
- On generalized Hamming weights of BCH codesIEEE Transactions on Information Theory, 1994
- Minimum distance bounds for cyclic codes and Deligne's theoremIEEE Transactions on Information Theory, 1993
- Undergraduate Algebraic Geometry1988
- On the covering radius of cyclic linear codes and arithmetic codesDiscrete Applied Mathematics, 1985