DCC
2008
IEEE
14 years 11 months ago
2008
IEEE
DCC
2008
IEEE
14 years 11 months ago
2008
IEEE
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...
DCC
2008
IEEE
14 years 11 months ago
2008
IEEE
DCC
2008
IEEE
14 years 11 months ago
2008
IEEE
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...
DCC
2008
IEEE
14 years 11 months ago
2008
IEEE
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 ...
DCC
2008
IEEE
14 years 11 months ago
2008
IEEE
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...
DCC
2008
IEEE
14 years 11 months ago
2008
IEEE
LaMacchia, Lauter and Mityagin recently presented a strong security definition for authenticated key agreement strengthening the well-known Canetti-Krawczyk definition. They also ...
DCC
2008
IEEE
14 years 11 months ago
2008
IEEE
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...
DCC
2008
IEEE
14 years 11 months ago
2008
IEEE
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...
DCC
2008
IEEE
14 years 11 months ago
2008
IEEE
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...