Affine and projective planes
Affine and projective planes
复制标题
DOI:
10.1016/0012-365x(90)90003-z
复制
发表时间:
1990-08
期刊:
影响因子:
--
通讯作者:
E. F. Assmus;J. D. Key
中科院分区:
文献类型:
--
作者:
E. F. Assmus;J. D. Key
The aim of this work is to suggest a setting for the discussion and classification of finite projective planes. In the past, two classification schemes have been put forward: the Lenz-Barlotti Classification (see [8, 93.11) and a more restricted classification of translation planes proposed by Ostrom (see [19]). Our approach is rather different from either of these two and rests heavily on the results and techniques of algebraic coding theory and, in particular, on the work of Philippe Delsarte.The approach is to study a finite projective plane 17 via its various affine parts and, to this end, we introduce the notion of the hull of an affine plane n: the hull turns out to be the code generated, over an appropriate finite field Fp, by all differences of those pairs of rows of an incidence matrix that represent parallel lines of n. In all known cases p will be the prime involved in the order, p’, of the affine plane Ed; in general it is any prime dividing the order n of the plane. Letting H be such a hull, we have H c F $, and the orthogonal HL (in the usual inner product in F;‘) is a linear (n’, k) code over Fp with minimum weight n and amongst its minimal-weight vectors one finds the affine plane n one began with. But, there can be (and frequently are) other affine planes to be found amongst the minimal-weight vectors of H’= B. For example: if JG= AG,(4), the desarguesian affine plane of order 4, B is the (16, 11) extended binary Hamming code; this latter code contains 112 copies of AG,(4) amongst its 140 weight-4 vectors. We investigate two central questions:(1) To what extent does the hull of an affine plane determine the plane?(2) How can the various (n’, k) codes over Fp of minimum weight n help to classify affine (and hence projective) planes? Toward this end we introduce a notion of “linear equivalence”: two affine