Sciweavers

DCC
2008
IEEE
14 years 4 months ago
Coprimitive sets and inextendable codes
Complete (n, r)-arcs in PG(k - 1, q) and projective (n, k, n - r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable le...
T. L. Alderson, Aiden A. Bruen
DCC
2008
IEEE
14 years 4 months ago
Random constructions and density results
András Gács, Tamás Szönyi
DCC
2008
IEEE
14 years 4 months ago
Sequences in abelian groups G of odd order without zero-sum subsequences of length exp ( G )
We present a new construction for sequences in the finite abelian group Cr n without zero-sum subsequences of length n, for odd n. This construction improves the maximal known car...
Yves Edel
DCC
2008
IEEE
14 years 4 months ago
Finite geometries
Aart Blokhuis, James W. P. Hirschfeld, Dieter Jung...
DCC
2008
IEEE
14 years 4 months ago
Explicit constructions for perfect hash families
Let k, v, t be integers such that k v t 2. A perfect hash family PHF(N; k, v, t) can be defined as an N ? k array with entries from a set of v symbols such that every N ?t suba...
Sosina Martirosyan, Tran van Trung
DCC
2008
IEEE
14 years 4 months ago
Williamson matrices up to order 59
A recent result of Schmidt has brought Williamson matrices back into the spotlight. In this paper a new algorithm is introduced to search for hard to find Williamson matrices. We ...
Wolf H. Holzmann, Hadi Kharaghani, Behruz Tayfeh-R...
DCC
2008
IEEE
14 years 4 months ago
Homogeneous factorisations of Johnson graphs
For a graph , subgroups M < G Aut(), and an edge partition E of , the pair (, E) is a (G, M)-homogeneous factorisation if M is vertex-transitive on and fixes setwise each part...
Maria Cristeta Cuaresma, Michael Giudici, Cheryl E...
DCC
2008
IEEE
14 years 4 months ago
Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS
LaMacchia, Lauter and Mityagin recently presented a strong security definition for authenticated key agreement strengthening the well-known Canetti-Krawczyk definition. They also ...
Berkant Ustaoglu
DCC
2008
IEEE
14 years 4 months ago
On Boolean functions with the sum of every two of them being bent
A set of Boolean functions is called a bent set if the sum of any two distinct members is a bent function. We show that any bent set yields a homogeneous system of linked symmetric...
Christian Bey, Gohar M. M. Kyureghyan
DCC
2008
IEEE
14 years 4 months ago
New negative Latin square type partial difference sets in nonelementary abelian 2-groups and 3-groups
A partial difference set having parameters (n2, r(n - 1), n + r2 - 3r, r2 - r) is called a Latin square type partial difference set, while a partial difference set having paramete...
John B. Polhill