类 型
9 篇文献
 
A Family of Complete Caps in PG(n, 2)  
We give a combinatorial construction of a one-parameter and a two-parameter family of complete caps in finite projective spaces over GF(2). As an application of our construction we find, for each α ε[......
Designs, Codes and Cryptography  2005
2次引用 0 0
SOME RESULTS ON 2 N−M DESIGNS OF RESOLUTION IV WITH (WEAK) MINIMUM ABERRATION  
It is known that all resolution IV regular 2 n−m designs of run size N = 2 n−m where 5N/16 < n < N/2 must be projections of the maximal even design with N/2 factors and, therefore, are even designs. T......
0次引用 0 0
Classification and Constructions of Complete Caps in Binary Spaces (revised version)  
We give new recursive constructions of complete caps in PG(n,2). We approach the problem of constructing caps with low dependency via the doubling construction and comparison to lower bounds. We repor......
0次引用 0 0
Colouring Cayley graphs  
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be ma......
1次引用 0 0
A Family of Complete Caps in PG(n; 2)  
We give a combinatorial construction of a one-parameter and a two-parameter family of complete caps in nite projective spaces over GF(2). As an application of our construction we nd, for each 2 (1:89;......
0次引用 0 0
Complete caps in projective space which are disjoint from a subspace of codimension two  
Working over the field of order 2 we consider those complete caps (maximal sets of points with no three collinear) which are disjoint from some codimension 2 subspace of projective space. We derive re......
1次引用 0 0
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.......
Designs, Codes and Cryptography  1999
6次引用 0 0
Long binary linear codes and large caps in projective space, Des  
Abstract. We obtain, in principle, a complete classification of all long inextendable binary linear codes. Several related constructions and results are presented.......
Codes Cryptogr  1999
0次引用 0 0
Binary Linear Codes and Caps in Finite Projective Geometries  
Abstract An n-cap is a set C of n points of PG(r; 2), the r-dimensional projective space over......
0次引用 0 0

Feedback
Feedback
Feedback
我想反馈:
排行榜