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
Codes, caps and linear spaces
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
CAPS OF PG(r,q) AND LINEAR CODES
NOTATION
Let V = Vr+1,q be the (r+1)-dimensional vector space over the Galois field GF(q) and let S = Sr,q = PG(r,q) be the related projective space of dimension r.
If x є V \ {0}, then we denote by [x] the point of S related to x. Let us denote by the same symbol K the following:
K = (x(1), x(2),…,x(k)) (ordered k-set of V), (1)
K = ([x(1)], [x(2)],…,[x(k)]) (ordered k-set of S), (2)
K = [x(1), x(2),…,x(k)] ((r+1)xk matrix over GF(q)), (3)
where x(1), x(2),…,x(k), are (column) vectors pairwise independent and spanning V. The latter condition implies
r + 1 ≤ k, (4)
and we have
<K> = <x(1),…, x(k) > = V, (5)
<K> = <[x(1)],…, [x(k)] > = S, (6)
rank K = r + 1. (7)
CODES AND ORDERED SETS OF POINTS
With K as above, let C = C(K) be the linear code of Vk,q defined by
C(K) = {x є Vk,q | Kx = 0}.
By (7) we have that
dim C(K) = k - (r+1).
Moreover, in order that each column of the matrix K is a non-zero vector, the code C(K) satisfies the following condition: (C) The code C does not contain any basis vector, i.e. it does not contain any fundamental subspace.
- Type
- Chapter
- Information
- Finite Geometries and DesignsProceedings of the Second Isle of Thorns Conference 1980, pp. 72 - 80Publisher: Cambridge University PressPrint publication year: 1981
- 3
- Cited by