9 research outputs found
Skew Hadamard difference sets from the Ree-Tits slice symplectic spreads in PG(3,3^{2h+1})
Using a class of permutation polynomials of obtained from the
Ree-Tits symplectic spreads in , we construct a family of skew
Hadamard difference sets in the additive group of . With the help
of a computer, we show that these skew Hadamard difference sets are new when
and . We conjecture that they are always new when .
Furthermore, we present a variation of the classical construction of the twin
prime power difference sets, and show that inequivalent skew Hadamard
difference sets lead to inequivalent difference sets with twin prime power
parameters.Comment: 18 page
Cyclotomic Constructions of Skew Hadamard Difference Sets
We revisit the old idea of constructing difference sets from cyclotomic
classes. Two constructions of skew Hadamard difference sets are given in the
additive groups of finite fields using unions of cyclotomic classes of order
, where is a prime and a positive integer. Our main tools
are index 2 Gauss sums, instead of cyclotomic numbers.Comment: 15 pages; corrected a few typos; to appear in J. Combin. Theory (A
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 Skew Hadamard difference sets
In this paper we construct exponentionally many non-isomorphic skew Hadamard
difference sets over an elementary abelian group of order
Proofs of two conjectures on ternary weakly regular bent functions
We study ternary monomial functions of the form f(x)=\Tr_n(ax^d), where
x\in \Ff_{3^n} and \Tr_n: \Ff_{3^n}\to \Ff_3 is the absolute trace
function. Using a lemma of Hou \cite{hou}, Stickelberger's theorem on Gauss
sums, and certain ternary weight inequalities, we show that certain ternary
monomial functions arising from \cite{hk1} are weakly regular bent, settling a
conjecture of Helleseth and Kholosha \cite{hk1}. We also prove that the
Coulter-Matthews bent functions are weakly regular.Comment: 20 page
Six Constructions of Difference Families
In this paper, six constructions of difference families are presented. These
constructions make use of difference sets, almost difference sets and disjoint
difference families, and give new point of views of relationships among these
combinatorial objects. Most of the constructions work for all finite groups.
Though these constructions look simple, they produce many difference families
with new parameters. In addition to the six new constructions, new results
about intersection numbers are also derived