An upper bound for the minimum weight of the dual codes of desarguesian planes

  • Authors:
  • J. D. Key;T. P. McDonough;V. C. Mavron

  • Affiliations:
  • School of Mathematical Sciences, University of KwaZulu-Natal, Pietermaritzburg 3209, South Africa;Institute of Mathematics and Physics, Aberystwyth University, Aberystwyth, Ceredigion SY23 3BZ, UK;Institute of Mathematics and Physics, Aberystwyth University, Aberystwyth, Ceredigion SY23 3BZ, UK

  • Venue:
  • European Journal of Combinatorics
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We show that a construction described in [K.L. Clark, J.D. Key, M.J. de Resmini, Dual codes of translation planes, European J. Combin. 23 (2002) 529-538] of small-weight words in the dual codes of finite translation planes can be extended so that it applies to projective and affine desarguesian planes of any order p^m where p is a prime, and m=1. This gives words of weight 2p^m+1-p^m-1p-1 in the dual of the p-ary code of the desarguesian plane of order p^m, and provides an improved upper bound for the minimum weight of the dual code. The same will apply to a class of translation planes that this construction leads to; these belong to the class of Andre planes. We also found by computer search a word of weight 36 in the dual binary code of the desarguesian plane of order 32, thus extending a result of Korchmaros and Mazzocca [Gabor Korchmaros, Francesco Mazzocca, On (q+t)-arcs of type (0,2,t) in a desarguesian plane of order q, Math. Proc. Cambridge Philos. Soc. 108 (1990) 445-459].