12,927 research outputs found
Linear Codes from Some 2-Designs
A classical method of constructing a linear code over \gf(q) with a
-design is to use the incidence matrix of the -design as a generator
matrix over \gf(q) of the code. This approach has been extensively
investigated in the literature. In this paper, a different method of
constructing linear codes using specific classes of -designs is studied, and
linear codes with a few weights are obtained from almost difference sets,
difference sets, and a type of -designs associated to semibent functions.
Two families of the codes obtained in this paper are optimal. The linear codes
presented in this paper have applications in secret sharing and authentication
schemes, in addition to their applications in consumer electronics,
communication and data storage systems. A coding-theory approach to the
characterisation of highly nonlinear Boolean functions is presented
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
- β¦