On the non-trivial minimal blocking sets in binary projective spaces

[1]  Fernanda Pambianco,et al.  On the spectrum of the valuesk for which a completek- cap in PG(n, q) exists , 1998 .

[2]  Fernanda Pambianco,et al.  Constructions of Small Complete Caps in Binary Projective Spaces , 2005, Des. Codes Cryptogr..

[3]  Stefano Marcugini,et al.  Minimal 1-saturating sets and complete caps in binary projective spaces , 2006, J. Comb. Theory, Ser. A.

[4]  A. Blokhuis,et al.  Blocking sets in projective spaces , 2012 .

[5]  Samira Kettoola,et al.  Some results on Ramsey numbers using sumfree sets , 1982, Discret. Math..

[6]  R. C. Bose,et al.  A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes , 1966 .

[7]  Leo Storme,et al.  The classification of the smallest nontrivial blocking sets in PG(n, 2) , 2006, J. Comb. Theory, Ser. A.

[8]  Aiden A. Bruen,et al.  Long Binary Linear Codes and Large Caps in Projective Space , 1999, Des. Codes Cryptogr..

[9]  Alfredo Milani,et al.  The sizes k of the complete k-caps in PG(n, q), for small q and 3 <= n >= 5 , 1998, Ars Comb..

[10]  W. Edwin Clark,et al.  Sum-Free Sets in Vector Spaces over GF(2) , 1992, J. Comb. Theory, Ser. A.

[11]  David L. Wehlau.  COMPLETE CAPS IN PROJECTIVE SPACE WHICH ARE DISJOINT FROM A SUBSPACE OF CODIMENSION TWO , 2001 .

[12]  Alexander A. Davydov,et al.  Weight spectrum of quasi-perfect binary codes with distance 4 , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[13]  A. Bruen,et al.  Binary codes and caps , 1998 .

[14]  Petr Lisonek,et al.  Classification and Constructions of Complete Caps in Binary Spaces , 2006, Des. Codes Cryptogr..

[15]  Stefano Marcugini,et al.  New Results on Binary Codes Obtained by Doubling Construction , 2018 .

[16]  Ernst M. Gabidulin,et al.  Linear codes with covering radius 2 and other new covering codes , 1991, IEEE Trans. Inf. Theory.