Book contents
- Frontmatter
- Contents
- Preface
- Notation and terminology
- 1 Design theory
- 2 Strongly regular graphs
- 3 Graphs with least eigenvalue –2
- 4 Regular two-graphs
- 5 Quasi-symmetric designs
- 6 A property of the number six
- 7 Partial geometries
- 8 Graphs with no triangles
- 9 Codes
- 10 Cyclic codes
- 11 The Golay codes
- 12 Reed-Muller and Kerdock codes
- 13 Self-orthogonal codes and projective planes
- 14 Quadratic residue codes and the Assmus-Mattson Theorem
- 15 Symmetry codes over F3
- 16 Nearly perfect binary codes and uniformly packed codes
- 17 Association schemes
- References
- Index
- List of Authors
16 - Nearly perfect binary codes and uniformly packed codes
Published online by Cambridge University Press: 08 January 2010
- Frontmatter
- Contents
- Preface
- Notation and terminology
- 1 Design theory
- 2 Strongly regular graphs
- 3 Graphs with least eigenvalue –2
- 4 Regular two-graphs
- 5 Quasi-symmetric designs
- 6 A property of the number six
- 7 Partial geometries
- 8 Graphs with no triangles
- 9 Codes
- 10 Cyclic codes
- 11 The Golay codes
- 12 Reed-Muller and Kerdock codes
- 13 Self-orthogonal codes and projective planes
- 14 Quadratic residue codes and the Assmus-Mattson Theorem
- 15 Symmetry codes over F3
- 16 Nearly perfect binary codes and uniformly packed codes
- 17 Association schemes
- References
- Index
- List of Authors
Summary
- Type
- Chapter
- Information
- Designs, Graphs, Codes and their Links , pp. 181 - 196Publisher: Cambridge University PressPrint publication year: 1991