On the weight distribution of a class of cyclic codes
Authors:
- 1 June 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1726-1729
Abstract
Let q=pn with n=2 m and p be a prime. Let 0lesklesn-1, knem. Assume k/(m, k) and m/(m, k) are both odd. In this paper we will study the following exponential sums of the SigmaxisinF qzetap Tr 1 m (alphax pm+1 )+Tr 1 n (betax pk+1 ) (alphaisinFp m, betaisinFq) where Tr1 n:Fq-Fp and Tr1 m:Fp mrarrFp are the canonical trace mappings and zetap=e2pii/p is a primitive p-th root of unity. As an application, we will determine the weight distribution of the cyclic codes C over Fp with parity-check polynomial h1(x)h2(x) where h1(x) and h2(x) are the minimal polynomials of pi-(p m +1) and pi-(p k +1) over Fp respectively for a primitive element pi of Fq.Keywords
This publication has 13 references indexed in Scilit:
- Cyclic Codes and Sequences From Generalized Coulter–Matthews FunctionIEEE Transactions on Information Theory, 2008
- Weight distribution of some reducible cyclic codesFinite Fields and Their Applications, 2008
- Value Distributions of Exponential Sums From Perfect Nonlinear Functions and Their ApplicationsIEEE Transactions on Information Theory, 2007
- Generalized Kasami Sequences: The Large SetIEEE Transactions on Information Theory, 2007
- The weight distribution of a class of linear codes from perfect nonlinear functionsIEEE Transactions on Information Theory, 2006
- Surfaces and the weight distribution of a family of codesIEEE Transactions on Information Theory, 1997
- Hasse-Davenport Curves, Gauss Sums, and Weight Distributions of Irreducible Cyclic CodesJournal of Number Theory, 1995
- Weight distributions of some binary primitive cyclic codesIEEE Transactions on Information Theory, 1994
- Minimum distance bounds for cyclic codes and Deligne's theoremIEEE Transactions on Information Theory, 1993
- Euler products, cyclotomy, and codingJournal of Number Theory, 1972