Sciweavers

DCC
1999
IEEE
13 years 6 months ago
A General Polynomial Sieve
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...
Shuhong Gao, Jason Howell
DCC
1999
IEEE
13 years 6 months ago
On the Characterization of Linear Uniquely Decodable Codes
Gérard D. Cohen, Josep Rifà, J. Tena...
DCC
1999
IEEE
13 years 6 months ago
Minimum Weight and Dimension Formulas for Some Geometric Codes
Neil J. Calkin, Jennifer D. Key, Marialuisa J. de ...
DCC
1999
IEEE
13 years 6 months ago
Long Binary Linear Codes and Large Caps in Projective Space
We obtain, in principle, a complete classification of all long inextendable binary linear codes. Several related constructions and results are presented.
Aiden A. Bruen, David L. Wehlau
DCC
1999
IEEE
13 years 6 months ago
Jacobi Polynomials, Type II Codes, and Designs
Alexis Bonnecaze, Bernard Mourrain, Patrick Sol&ea...
DCC
1999
IEEE
13 years 6 months ago
On Unitals with Many Baer Sublines
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...
Simeon Ball, Aart Blokhuis, Christine M. O'Keefe
DCC
1999
IEEE
13 years 6 months ago
A Steiner 5-Design on 36 Points
Anton Betten, Reinhard Laue, Alfred Wassermann
CG
1999
Springer
13 years 6 months ago
Efficient visibility processing for projective texture mapping
Projective texture-mapping is a powerful tool for image-based rendering. However, visibility information must be obtained in order to project correct textures onto the geometric s...
Yizhou Yu
CG
1999
Springer
13 years 6 months ago
Regularised marching tetrahedra: improved iso-surface extraction
Graham M. Treece, Richard W. Prager, Andrew H. Gee