Cantitate/Preț
Produs

Designs, Graphs, Codes and their Links: London Mathematical Society Student Texts, cartea 22

Autor P. J. Cameron, J. H. van Lint
en Limba Engleză Hardback – 18 sep 1991
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 46831 lei  6-8 săpt.
  Cambridge University Press – 18 sep 1991 46831 lei  6-8 săpt.
Hardback (1) 95194 lei  6-8 săpt.
  Cambridge University Press – 18 sep 1991 95194 lei  6-8 săpt.

Din seria London Mathematical Society Student Texts

Preț: 95194 lei

Preț vechi: 110690 lei
-14% Nou

Puncte Express: 1428

Preț estimativ în valută:
16843 19622$ 14708£

Carte tipărită la comandă

Livrare economică 17-31 ianuarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780521413251
ISBN-10: 0521413257
Pagini: 252
Ilustrații: 10 b/w illus.
Dimensiuni: 157 x 236 x 18 mm
Greutate: 0.56 kg
Ediția:New.
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria London Mathematical Society Student Texts

Locul publicării:Cambridge, United Kingdom

Cuprins

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.

Descriere

This book demonstrates the connection between, and the applications of, design theory to graphs and codes. It is suitable as a textbook for advanced undergraduate students.