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) - 3 if n ≥ 10 is even and size 15(2(n-5)/2) - 3 if n ≥ 9 is odd. Here we give a simple construction of complete caps in PG(n,2) of size 24(2(n-6)/2) - 3 if n is even and size 16(2(n-5)/2) - 3 if n is odd. Thus these caps are only slightly larger than the smallest complete caps known in PG(n,2).
[1] Aiden A. Bruen,et al. New Codes from Old; A New Geometric Construction , 2001, J. Comb. Theory, Ser. A.
[2] Ernst M. Gabidulin,et al. Linear codes with covering radius 2 and other new covering codes , 1991, IEEE Trans. Inf. Theory.