DCC
2010
IEEE
13 years 4 months ago
2010
IEEE
Some new examples of two
DCC
2010
IEEE
13 years 4 months ago
2010
IEEE
This article studies the small weight codewords of the functional code CHerm(X), with X a non-singular Hermitian variety of PG(N, q2). The main result of this article is that the ...
DCC
2010
IEEE
13 years 4 months ago
2010
IEEE
In this paper, we consider new results on (k, n)-caps with n > 2. We provide a lower bound on the size of such caps. Furthermore, we generalize two product constructions for (k,...
DCC
2010
IEEE
13 years 4 months ago
2010
IEEE
In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-secure aggregate signature scheme. Their scheme uses bilinear pairings and their security proof is in the...
DCC
2010
IEEE
13 years 4 months ago
2010
IEEE
We investigate unconditional security for message authentication protocols that are designed using two-channel cryptography. We look at both noninteractive message authentication ...
DCC
2010
IEEE
13 years 4 months ago
2010
IEEE
In this note, we characterize the Grassmann embedding of H(q), q even, as the unique full embedding of H(q) in PG(12, q) for which each ideal line of H(q) is contained in a plane....
DCC
2010
IEEE
13 years 4 months ago
2010
IEEE
In this paper we develop general techniques for enumerating orthogonal Buekenhout unitals embedded in two-dimensional translation planes. We then apply these techniques in the reg...
DCC
2010
IEEE
13 years 4 months ago
2010
IEEE
Let n 3 be an integer, let Vn(2) denote the vector space of dimension n over GF(2), and let c be the least residue of n modulo 3. We prove that the maximum number of 3-dimensional...
DCC
2010
IEEE
13 years 4 months ago
2010
IEEE
Linear sets generalise the concept of subgeometries in a projective space. They have many applications in finite geometry. In this paper we address two problems for linear sets: t...
DCC
2010
IEEE
13 years 4 months ago
2010
IEEE
We derive lower and upper bounds for the size of a hyperoval of a finite polar space of rank r {2, 3}. We give a computer-free proof for the uniqueness, up to isomorphism, of the...