DCC
1999
IEEE
13 years 4 months ago
1999
IEEE
Recently, P.J. Cameron studied a class of block designs which generalises the classes of t-designs, -resolved 2-designs, orthogonal arrays, and other classes of combinatorial desi...
DCC
1999
IEEE
13 years 4 months ago
1999
IEEE
We consider the space of ternary words of length n and fixed weight w with the usual Hamming distance. A sequence of perfect single error correcting codes in this space is construc...
DCC
1999
IEEE
13 years 4 months ago
1999
IEEE
An important component of the index calculus methods for finding discrete logarithms is the acquisition of smooth polynomial relations. Gordon and McCurley (1992) developed a sieve...
DCC
1999
IEEE
13 years 4 months ago
1999
IEEE
DCC
1999
IEEE
13 years 4 months ago
1999
IEEE
DCC
1999
IEEE
13 years 4 months ago
1999
IEEE
DCC
1999
IEEE
13 years 4 months ago
1999
IEEE
We obtain, in principle, a complete classification of all long inextendable binary linear codes. Several related constructions and results are presented.
DCC
1999
IEEE
13 years 4 months ago
1999
IEEE
DCC
1999
IEEE
13 years 4 months ago
1999
IEEE
We identify the points of PG(2, q) with the directions of lines in GF(q3), viewed as a 3dimensional affine space over GF(q). Within this framework we associate to a unital in PG(2...
DCC
1999
IEEE
13 years 4 months ago
1999
IEEE
