Book contents
- Frontmatter
- Contents
- PREFACE
- Introduction
- Generalized Steiner systems of type 3-(v, {4,6}, 1)
- Some remarks on D.R. Hughes' construction of M12 and its associated designs
- On k-sets of class [0,1,2,n]2 in PG(r,q)
- Covering graphs and symmetric designs
- Arcs and blocking sets
- Flat embeddings of near 2n-gons
- Codes, caps and linear spaces
- Geometries originating from certain distance-regular graphs
- Transitive automorphism groups of finite quasifields
- On k-sets of type (m,n) in projective planes of square order
- On k-sets of type (m,n) in a Steiner system S(2, l, v)
- Some translation planes of order 81
- A new partial geometry constructed from the Hoffman-Singleton graph
- Locally cotriangular graphs
- Coding theory of designs
- On shears in fixed-point-free affine groups
- On (k,n)-arcs and the falsity of the Lunelli-Sce conjecture
- Cubic surfaces whose points all lie on their 27 lines
- Existence results for translation nets
- Translation planes having PSL(2,w) or SL(3,w) as a collineation group
- Sequenceable groups: a survey
- Polar spaces embedded in a projective space
- On relations among the projective geometry codes
- Partition loops and affine geometries
- Regular cliques in graphs and special 1½ designs
- Bericht über Hecke Algebren und Coxeter Algebren eindlicher Geometrien
- On buildings and locally finite Tits geometries
- Moufang conditions for finite generalized quadrangles
- Embedding geometric lattices in a projective space
- Coverings of certain finite geometries
- On class-regular projective Hjelmslev planes
- On multiplicity-free permutation representations
- On a characterization of the Grassmann manifold representing the lines in a projective space
- Affine subplanes of projective planes
- Point stable designs
- Other talks
- Participants
Coding theory of designs
Published online by Cambridge University Press: 05 April 2013
- Frontmatter
- Contents
- PREFACE
- Introduction
- Generalized Steiner systems of type 3-(v, {4,6}, 1)
- Some remarks on D.R. Hughes' construction of M12 and its associated designs
- On k-sets of class [0,1,2,n]2 in PG(r,q)
- Covering graphs and symmetric designs
- Arcs and blocking sets
- Flat embeddings of near 2n-gons
- Codes, caps and linear spaces
- Geometries originating from certain distance-regular graphs
- Transitive automorphism groups of finite quasifields
- On k-sets of type (m,n) in projective planes of square order
- On k-sets of type (m,n) in a Steiner system S(2, l, v)
- Some translation planes of order 81
- A new partial geometry constructed from the Hoffman-Singleton graph
- Locally cotriangular graphs
- Coding theory of designs
- On shears in fixed-point-free affine groups
- On (k,n)-arcs and the falsity of the Lunelli-Sce conjecture
- Cubic surfaces whose points all lie on their 27 lines
- Existence results for translation nets
- Translation planes having PSL(2,w) or SL(3,w) as a collineation group
- Sequenceable groups: a survey
- Polar spaces embedded in a projective space
- On relations among the projective geometry codes
- Partition loops and affine geometries
- Regular cliques in graphs and special 1½ designs
- Bericht über Hecke Algebren und Coxeter Algebren eindlicher Geometrien
- On buildings and locally finite Tits geometries
- Moufang conditions for finite generalized quadrangles
- Embedding geometric lattices in a projective space
- Coverings of certain finite geometries
- On class-regular projective Hjelmslev planes
- On multiplicity-free permutation representations
- On a characterization of the Grassmann manifold representing the lines in a projective space
- Affine subplanes of projective planes
- Point stable designs
- Other talks
- Participants
Summary
INTRODUCTION
The amount of information which coding theory gives about a design can vary enormously from one design to another. As it is now known that a plane of order 10 can have only the identical collineation, its binary code is now our main source of information on it.
Section 2 gives the definition of the code of a design in terms of its incidence matrix.
For a (v, b, r, k, λ) design D it is advantageous to consider codes over finite fields Fq, where q = pt, p a prime dividing r - λ, and in Section 3 theorems dealing with this are given. The Thompson-Hayden theorems of this section deal with a vector space V over a field F and the action of a finite orthogonal group G whose order has an inverse in F. We are concerned with the action of G on a subspace C of V which is a G-module. This is particularly appropriate when C is a code and G a group of automorphisms of C.
In Section 4 the role of coding theory is dicussed in connection with the plane of order 10 and the construction of a (41, 16, 6) design.
THE CODE OF A DESIGN
A balanced incomplete block design D, or more briefly design, is a system of v points a1,…,av and b blocks B1,…Bb, together with an incidence relation ai ∈ Bj (read ai belongs to Bj or Bj contains ai) between certain points ai and blocks Bj.
- Type
- Chapter
- Information
- Finite Geometries and DesignsProceedings of the Second Isle of Thorns Conference 1980, pp. 134 - 145Publisher: Cambridge University PressPrint publication year: 1981