Abstract
In this paper, we study the p-ary linear code C(PG(n,q)), q = p h, p prime, h ≥ 1, generated by the incidence matrix of points and hyperplanes of a Desarguesian projective space PG(n,q), and its dual code. We link the codewords of small weight of this code to blocking sets with respect to lines in PG(n,q) and we exclude all possible codewords arising from small linear blocking sets. We also look at the dual code of C(PG(n,q)) and we prove that finding the minimum weight of the dual code can be reduced to finding the minimum weight of the dual code of points and lines in PG(2,q). We present an improved upper bound on this minimum weight and we show that we can drop the divisibility condition on the weight of the codewords in Sachar’s lower bound (Geom Dedicata 8:407–415, 1979).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Assmus Jr. E.F., Key J.D.: Designs and Their Codes. Cambridge University Press (1992).
Bagchi B. and Inamdar S.P. (2002). Projective geometric codes. J. Combin. Theory Ser. A 99: 128–142
Bose R.C. and Burton R.C. (1966). A characterization of flat spaces in a finite geometry and the uniqueness of the Hamming and the MacDonald codes. J. Combin. Theory 1: 96–104
Chouinard K.: Weight distributions of codes from planes. Ph.D. thesis, University of Virginia (August 1998).
Fack V., Fancsali Sz., Storme L., Vande Voorde G. and Winne J. (2008). Small weight codewords in codes arising from Desarguesian projective planes. Des. Codes Cryptogr. 46(1): 25–43
Ferret S., Storme L., Sziklai P., Weiner Zs.: A t mod p result on multiple (n − k)-blocking sets in PG(n,q). Innov. Incidence Geom. (accepted).
Gács A., Szbalanyi T. and Weiner Zs. (2003). On the spectrum of minimal blocking sets in PG(2,q). J. Geom. 76: 256–281
Lavrauw M.: Scattered spaces with respect to spreads, and eggs in finite projective spaces. Dissertation, Eindhoven University of Technology, Eindhoven, viii+115 pp (2001).
Lunardon G. (1999). Normal spreads. Geom. Dedicata 75: 245–261
Prange E.: The use of coset equivalence in the analysis and decoding of group codes. Electronics Research Directorate, Air Force Cambridge Research Center (June 1959).
Rudolph L.D. (1967). A class of majority logic decodable codes. IEEE Trans. Inform. Theory 13: 305–307
Sachar H. (1979). The F p span of the incidence matrix of a finite projective plane. Geom. Dedicata 8: 407–415
Sziklai P.: On small blocking sets and their linearity. J. Combin. Theory Ser. A (to appear).
Szbalanyi T. (1997). Blocking sets in Desarguesian affine and projective planes. Finite Fields Appl. 3: 187–202
Weiner Zs. (2005). Small point sets of \({PG(n,\sqrt{q})}\) intersecting every k-space in 1 modulo \({\sqrt{q}}\) pointsInnov. Incidence Geom. 1: 171–180
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by R. Hill.
G. Van de Voorde’s research was supported by the Institute for the Promotion of Innovation through Science and Technology in Flanders (IWT-Vlaanderen).
Rights and permissions
About this article
Cite this article
Lavrauw, M., Storme, L. & Van de Voorde, G. On the code generated by the incidence matrix of points and hyperplanes in PG(n,q) and its dual. Des. Codes Cryptogr. 48, 231–245 (2008). https://doi.org/10.1007/s10623-008-9203-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-008-9203-9