×

Recursive constructions for skew resolutions in affine geometries. (English) Zbl 0511.05023


MSC:

05B25 Combinatorial aspects of finite geometries
51D20 Combinatorial geometries and geometric closure systems
51E20 Combinatorial structures in finite projective spaces
PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] Baker R. D.,Partitioning the planes of AG 2m (2)into 2-designs. Discrete Math.15 (1974), 205–211. · Zbl 0326.05013 · doi:10.1016/0012-365X(76)90025-X
[2] Beutelspacher, A.,On parallelisms in finite projective spaces. Geometriae Dedicata3 (1974), 35–40. · Zbl 0282.50019 · doi:10.1007/BF00181359
[3] Denniston, R. H. F.,Some packings of projective spaces. Atti Accad. Naz. Lincei Rend Cl. Sci. Fis. Mat. Natur. (1972), 52. · Zbl 0239.50013
[4] Fuji-Hara, R. andVanstone, S. A.,On the spectrum of doubly resolvable designs. 11th Southeastern Conference on Combinatorics Graph Theory and Computing, Boca Raton (1980).
[5] Fuji-Hara, R. andVanstone, S. A.,Affine geometries obtained from projective planes and skew resolutions on AG(3,q). Ann. Discrete Math.14 (1982).
[6] Fuji-Hara, R. andVanstone, S. A.,Orthogonal resolutions of lines in AG(n, q). Ann. Discrete Math. (1982). · Zbl 0509.05013
[7] Wilson, R. M.,Construction and uses of pairwise balanced designs. In Proc. NATO Advanced Study Inst. on Combinatorics, Matematisch Centrum, Amsterdam, 1974. · Zbl 0312.05010
[8] Zaitsev, G. V., Zinovjev,V. A. andSemakov, N. V.,Interrelations of preparate and Hamming codes and extension of Hamming codes to new double-error-correcting codes. In Proc. 2nd Internat. Symp. on Information Theory Tsahkadsor, Armenia 1971, Budapest, 1973.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.