Designs, graphs, codes and their links
Author(s)
Bibliographic Information
Designs, graphs, codes and their links
(London Mathematical Society student texts, 22)
Cambridge University Press, 1991
- : hard
- : pbk
Available at 69 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references (p. [215]-226) and index
Description and Table of Contents
Description
Although graph theory, design theory, and coding theory had their origins in various areas of applied mathematics, today they are to be found under the umbrella of discrete mathematics. Here the authors have considerably reworked and expanded their earlier successful books on graphs, codes and designs, into an invaluable textbook. They do not seek to consider each of these three topics individually, but rather to stress the many and varied connections between them. The discrete mathematics needed is developed in the text, making this book accessible to any student with a background of undergraduate algebra. Many exercises and useful hints are included througout, and a large number of references are given.
Table of Contents
- 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 6
- 7. Partial geometries
- 8. Graphs with no triangles
- 9. Codes
- 10. Cyclic codes
- 11. The Golay codes
- 12. Reed-Muller codes
- 13. Self-dual codes and projective plane
- 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.
by "Nielsen BookData"