Designs and their codes
Proper blocking sets in projective spaces
Proceedings of the international conference on Combinatorics '94
Small blocking sets in higher dimensions
Journal of Combinatorial Theory Series A
Journal of Combinatorial Theory Series A
On the code generated by the incidence matrix of points and hyperplanes in PG(n,q) and its dual
Designs, Codes and Cryptography
On small blocking sets and their linearity
Journal of Combinatorial Theory Series A
Blocking Sets in Desarguesian Affine and Projective Planes
Finite Fields and Their Applications
Journal of Combinatorial Theory Series A
Small weight codewords in the dual code of points and hyperplanes in PG(n, q), q even
Designs, Codes and Cryptography
Hi-index | 0.00 |
In this paper, we study the p-ary linear code C"k(n,q), q=p^h, p prime, h=1, generated by the incidence matrix of points and k-dimensional spaces in PG(n,q). For k=n/2, we link codewords of C"k(n,q)@?C"k(n,q)^@? of weight smaller than 2q^k to k-blocking sets. We first prove that such a k-blocking set is uniquely reducible to a minimal k-blocking set, and exclude all codewords arising from small linear k-blocking sets. For k=n/2. Next, we study the dual code of C"k(n,q) and present a lower bound on the weight of the codewords, hence extending the results of Sachar [H. Sachar, The F"p span of the incidence matrix of a finite projective plane, Geom. Dedicata 8 (1979) 407-415] to general dimension.