合 作 者
期刊 & 会议
年  份
David L. Wehlau 的论文(26) 排序方式:
Binary codes and caps  
Abstract: The connection between maximal caps (sometimes called complete caps) and certain binary codes called quasi-perfect codes is described. We provide a geometric approach to the foundational wor......
ACM Journal of Computer Documentation  1998
9次引用 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
NOETHER NUMBERS FOR SUBREPRESENTATIONS OF CYCLIC GROUPS OF PRIME ORDER  
Let W be a nite-dimensional Z=p-module over a eld, k, of characteristic p. The maximum degree of an indecomposable element of the algebra of invariants, k(W )Z=p, is called the Noether number of the ......
Bulletin of The London Mathematical Society  2002
5次引用 0 0
New Codes from Old; A New Geometric Construction  
Journal of Combinatorial Theory  2001
5次引用 0 0
Caps and Colouring Steiner Triple Systems  
Hill (6) showed that the largest cap inPG.5; 3/ has cardinality 56. Using this cap it is easy to construct a cap of cardinality 45 inAG.5; 3/. Here we show that the size of a cap inAG.5; 3/ is bounded......
Designs, Codes and Cryptography  1998
4次引用 0 0
There Exist Caps Which Block All Spaces of Fixed Codimension in G (n, 2)  
Journal of Combinatorial Theory  1996
4次引用 0 0
Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function  
Abstract: Let f(n) ? minf (G H ) : G and H are n-chromatic digraphsg and g(n) ? minf (G H ) : G and H are n-chromatic graphs}. We prove that f is bounded if and only if g is bounded. 2005 Wiley Period......
Journal of Graph Theory  2006
3次引用 0 0
A family of small complete caps in PG(n, 2)  
The smallest known complete caps in PG(n, 2) have size 23(2(n−6)/2) − 3i fn ≥ 10 is even and size 15(2(n−5)/2) − 3i fn ≥ 9i sodd. Here we give a simple construction of complete caps in PG(n, 2) of siz......
European Journal of Combinatorics  2003
2次引用 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
2次引用 0 0
Partitioning Quadrics, Symmetric Group Divisible Designs and Caps  
Using partitionings of quadrics we give a geometric construction of certain symmetric group divisible designs. It is shown that some of them at least are self-dual. The designs that we construct here ......
Designs, Codes and Cryptography  1997
1次引用 0 0

1/3 第一页 上一页 1 2 3 下一页
Feedback
Feedback
Feedback
我想反馈:
排行榜