Combinatorics: Proceedings, Issue 55, Part 1 - Issue 57, Part 1Marshall Hall Mathematisch Centrum, 1974 - Coding theory |
Other editions - View all
Common terms and phrases
affine spaces algebraic ANDRÉ association scheme Assume base point binary block designs BOSE chapter code of order coding theory compatible condition configuration contains defined definition DEMBOWSKI denote diagonal elements example exists field F finite nearaffine space fully indecomposable G₁ Gauss sum geometry GF q given GLEASON's theorem graph Hamming schemes Hence hyperplane implies incidence matrix ind(x indeterminates invariants J.H. VAN LINT Johnson schemes lemma Let F linear codes MACWILLIAMS Math matrix equation metric scheme N.J.A. SLOANE N₁ nearly perfect codes non-zero number of points obtain orthogonal Latin squares pairwise perfect codes permutation groups polynomial positive integers prime power projective plane PROOF properties proposition 2.2 prove Q-polynomial quadratic residue quasigroups remark root of unity self-dual code space F straight lines subset t-designs theorem 3.2 transversal design vector weight enumerator x,y e xlly zeros МСТ