20,001 research outputs found
The weight distributions of a class of cyclic codes III
Recently, the weight distributions of the duals of the cyclic codes with two
zeros have been obtained for several cases. In this paper we solve one more
special case. The problem of finding the weight distribution is transformed
into a problem of evaluating certain character sums over finite fields, which
in turn can be solved by using the Jacobi sums directly
The Weight Enumerator of Three Families of Cyclic Codes
Cyclic codes are a subclass of linear codes and have wide applications in
consumer electronics, data storage systems, and communication systems due to
their efficient encoding and decoding algorithms. Cyclic codes with many zeros
and their dual codes have been a subject of study for many years. However,
their weight distributions are known only for a very small number of cases. In
general the calculation of the weight distribution of cyclic codes is heavily
based on the evaluation of some exponential sums over finite fields. Very
recently, Li, Hu, Feng and Ge studied a class of -ary cyclic codes of length
, where is a prime and is odd. They determined the weight
distribution of this class of cyclic codes by establishing a connection between
the involved exponential sums with the spectrum of Hermitian forms graphs. In
this paper, this class of -ary cyclic codes is generalized and the weight
distribution of the generalized cyclic codes is settled for both even and
odd alone with the idea of Li, Hu, Feng, and Ge. The weight distributions
of two related families of cyclic codes are also determined.Comment: 13 Pages, 3 Table
The Weight Distributions of a Class of Cyclic Codes with Three Nonzeros over F3
Cyclic codes have efficient encoding and decoding algorithms. The decoding
error probability and the undetected error probability are usually bounded by
or given from the weight distributions of the codes. Most researches are about
the determination of the weight distributions of cyclic codes with few
nonzeros, by using quadratic form and exponential sum but limited to low
moments. In this paper, we focus on the application of higher moments of the
exponential sum to determine the weight distributions of a class of ternary
cyclic codes with three nonzeros, combining with not only quadratic form but
also MacWilliams' identities. Another application of this paper is to emphasize
the computer algebra system Magma for the investigation of the higher moments.
In the end, the result is verified by one example using Matlab.Comment: 10 pages, 3 table
A Class of Three-Weight Cyclic Codes
Cyclic codes are a subclass of linear codes and have applications in consumer
electronics, data storage systems, and communication systems as they have
efficient encoding and decoding algorithms. In this paper, a class of
three-weight cyclic codes over \gf(p) whose duals have two zeros is
presented, where is an odd prime. The weight distribution of this class of
cyclic codes is settled. Some of the cyclic codes are optimal. The duals of a
subclass of the cyclic codes are also studied and proved to be optimal.Comment: 11 Page
On the weight distributions of several classes of cyclic codes from APN monomials
Let be an odd integer and be an odd prime. % with ,
where is an odd integer.
In this paper, many classes of three-weight cyclic codes over
are presented via an examination of the condition for the
cyclic codes and , which have
parity-check polynomials and respectively, to
have the same weight distribution, where is the minimal polynomial of
over for a primitive element of
. %For , the duals of five classes of the proposed
cyclic codes are optimal in the sense that they meet certain bounds on linear
codes. Furthermore, for and positive integers such
that there exist integers with and satisfying , the value
distributions of the two exponential sums T(a,b)=\sum\limits_{x\in
\mathbb{F}_{p^m}}\omega^{\Tr(ax+bx^e)} and S(a,b,c)=\sum\limits_{x\in
\mathbb{F}_{p^m}}\omega^{\Tr(ax+bx^e+cx^s)}, where , are
settled. As an application, the value distribution of is utilized to
investigate the weight distribution of the cyclic codes
with parity-check polynomial . In the case of and
even satisfying the above condition, the duals of the cyclic codes
have the optimal minimum distance
- β¦