Sciweavers

89
Voted
DCC
2004
IEEE
16 years 7 days ago
On Non-Polynomial Latin Squares
A Latin square L = L( ij) over the set S = {0, 1, . . . , n - 1} is called totally non-polynomial over Zn iff
Otokar Grosek, Peter Horák, Tran van Trung
98
Voted
DCC
2004
IEEE
16 years 7 days ago
Periodicity and Correlation Properties of d-FCSR Sequences
A d-feedback-with-carry shift register (d-FCSR) is a finite state machine, similar to a linear feedback shift register, in which a small amount of memory and a delay (by d-clock c...
Mark Goresky, Andrew Klapper
64
Voted
DCC
2004
IEEE
16 years 7 days ago
Extensions of Generalized Product Caps
We give some variants of a new construction for caps. As an application of these constructions we obtain a 1216?cap in PG(9, 3) a 6464?cap in PG(11, 3) and several caps in ternary...
Yves Edel
75
Voted
DCC
2004
IEEE
16 years 7 days ago
Parameter Inequalities for Orthogonal Arrays with Mixed Levels
An important question in the construction of orthogonal arrays is what the minimal size of an array is when all other parameters are fixed. In this paper, we will provide a genera...
Wiebke S. Diestelkamp
73
Voted
DCC
2004
IEEE
16 years 7 days ago
Symplectic Spreads
We construct an infinite family of symplectic spreads in spaces of odd rank and characteristic.
Simeon Ball, John Bamberg, Michel Lavrauw, Tim Pen...