Sciweavers

4983 search results - page 85 / 997
» order 2008
Sort
View
CISS
2008
IEEE
14 years 4 months ago
Costas array generator polynomials in finite fields
—Permutations of order N are generated using polynomials in a Galois field GF(q) where q > N+1, which can be written as a linear transformation on a vector of polynomial coeff...
James K. Beard
DM
2008
62views more  DM 2008»
13 years 10 months ago
Classification of some strongly regular subgraphs of the McLaughlin graph
By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v, k, ,
Jan Degraer, Kris Coolsaet
DAM
2006
69views more  DAM 2006»
13 years 10 months ago
On the binary projective codes with dimension 6
All binary projective codes of dimension up to 6 are classified. Information about the number of the codes with different minimum distances and different orders of automorphism gro...
Iliya Bouyukliev
DM
1999
69views more  DM 1999»
13 years 9 months ago
Maximal sets of mutually orthogonal Latin squares
Maximal sets of s mutually orthogonal Latin squares of order v are constructed for in
David A. Drake, G. H. John van Rees, W. D. Wallis
DM
2008
88views more  DM 2008»
13 years 10 months ago
A technique to study the correlation measures of binary sequences
Let EN = (e1, e2, . . . , eN ) be a binary sequence with ei {+1, -1}. For 2 k N, the correlation measure of order k of the sequence is defined by Mauduit and S
Venkat Anantharam