类 型
5 篇文献
 
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
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
Constructions of Small Complete Caps in Binary Projective Spaces  
In the binary projective spaces PG(n,2) k-caps are called large if k > 2n-1 and smallif k ≤ 2n-1. In this paper we propose new constructions producing infinite families of small binary complete caps.......
Designs, Codes and Cryptography  2005
0次引用 0 0
Classification and Constructions of Complete Caps in Binary Spaces  
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......
Designs, Codes and Cryptography  2006
2次引用 0 0
Presentation Theorems for Coded Character Sets  
The notion of 'presentation', as used in combinatorial group theory, is applied to coded character sets(CCSs) - sets which facilitate the interchange of messages in a digital computer network(DCN) . B......
Computing Research Repository  2006
0次引用 0 0

Feedback
Feedback
Feedback
我想反馈:
排行榜