Gespeichert in:
Beteilige Person: | |
---|---|
Weitere beteiligte Personen: | |
Format: | E-Book |
Sprache: | Englisch |
Veröffentlicht: |
Cambridge
Cambridge University Press
1980
|
Schriftenreihe: | London Mathematical Society lecture note series
43 |
Links: | https://doi.org/10.1017/CBO9780511662140 |
Zusammenfassung: | This book is concerned with the relations between graphs, error-correcting codes and designs, in particular how techniques of graph theory and coding theory can give information about designs. A major revision and expansion of a previous volume in this series, this account includes many examples and new results as well as improved treatments of older material. So that non-specialists will find the treatment accessible the authors have included short introductions to the three main topics. This book will be welcomed by graduate students and research mathematicians and be valuable for advanced courses in finite combinatorics. |
Umfang: | 1 Online-Ressource (vii, 147 Seiten) |
ISBN: | 9780511662140 |
Internformat
MARC
LEADER | 00000nam a2200000 i 4500 | ||
---|---|---|---|
001 | ZDB-20-CTM-CR9780511662140 | ||
003 | UkCbUP | ||
005 | 20151005020623.0 | ||
006 | m|||||o||d|||||||| | ||
007 | cr|||||||||||| | ||
008 | 091215s1980||||enk o ||1 0|eng|d | ||
020 | |a 9780511662140 | ||
100 | 1 | |a Cameron, Peter J. |d 1947- | |
245 | 1 | 0 | |a Graphs, codes, and designs |c P.J. Cameron, J.H. van Lint |
246 | 3 | |a Graphs, Codes & Designs | |
264 | 1 | |a Cambridge |b Cambridge University Press |c 1980 | |
300 | |a 1 Online-Ressource (vii, 147 Seiten) | ||
336 | |b txt | ||
337 | |b c | ||
338 | |b cr | ||
490 | 1 | |a London Mathematical Society lecture note series |v 43 | |
520 | |a This book is concerned with the relations between graphs, error-correcting codes and designs, in particular how techniques of graph theory and coding theory can give information about designs. A major revision and expansion of a previous volume in this series, this account includes many examples and new results as well as improved treatments of older material. So that non-specialists will find the treatment accessible the authors have included short introductions to the three main topics. This book will be welcomed by graduate students and research mathematicians and be valuable for advanced courses in finite combinatorics. | ||
700 | 1 | |a Lint, Jacobus Hendricus van |d 1932- | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521231411 |
966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9780511662140 |3 Volltext |
912 | |a ZDB-20-CTM | ||
912 | |a ZDB-20-CTM | ||
049 | |a DE-91 |
Datensatz im Suchindex
DE-BY-TUM_katkey | ZDB-20-CTM-CR9780511662140 |
---|---|
_version_ | 1832177780165443586 |
adam_text | |
any_adam_object | |
author | Cameron, Peter J. 1947- |
author2 | Lint, Jacobus Hendricus van 1932- |
author2_role | |
author2_variant | j h v l jhv jhvl |
author_facet | Cameron, Peter J. 1947- Lint, Jacobus Hendricus van 1932- |
author_role | |
author_sort | Cameron, Peter J. 1947- |
author_variant | p j c pj pjc |
building | Verbundindex |
bvnumber | localTUM |
collection | ZDB-20-CTM |
format | eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01482nam a2200277 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9780511662140</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20151005020623.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">091215s1980||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511662140</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cameron, Peter J.</subfield><subfield code="d">1947-</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graphs, codes, and designs</subfield><subfield code="c">P.J. Cameron, J.H. van Lint</subfield></datafield><datafield tag="246" ind1="3" ind2=" "><subfield code="a">Graphs, Codes & Designs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1980</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (vii, 147 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">London Mathematical Society lecture note series</subfield><subfield code="v">43</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This book is concerned with the relations between graphs, error-correcting codes and designs, in particular how techniques of graph theory and coding theory can give information about designs. A major revision and expansion of a previous volume in this series, this account includes many examples and new results as well as improved treatments of older material. So that non-specialists will find the treatment accessible the authors have included short introductions to the three main topics. This book will be welcomed by graduate students and research mathematicians and be valuable for advanced courses in finite combinatorics.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lint, Jacobus Hendricus van</subfield><subfield code="d">1932-</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521231411</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/CBO9780511662140</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
id | ZDB-20-CTM-CR9780511662140 |
illustrated | Not Illustrated |
indexdate | 2025-05-15T09:21:32Z |
institution | BVB |
isbn | 9780511662140 |
language | English |
open_access_boolean | |
owner | DE-91 DE-BY-TUM |
owner_facet | DE-91 DE-BY-TUM |
physical | 1 Online-Ressource (vii, 147 Seiten) |
psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
publishDate | 1980 |
publishDateSearch | 1980 |
publishDateSort | 1980 |
publisher | Cambridge University Press |
record_format | marc |
series2 | London Mathematical Society lecture note series |
spelling | Cameron, Peter J. 1947- Graphs, codes, and designs P.J. Cameron, J.H. van Lint Graphs, Codes & Designs Cambridge Cambridge University Press 1980 1 Online-Ressource (vii, 147 Seiten) txt c cr London Mathematical Society lecture note series 43 This book is concerned with the relations between graphs, error-correcting codes and designs, in particular how techniques of graph theory and coding theory can give information about designs. A major revision and expansion of a previous volume in this series, this account includes many examples and new results as well as improved treatments of older material. So that non-specialists will find the treatment accessible the authors have included short introductions to the three main topics. This book will be welcomed by graduate students and research mathematicians and be valuable for advanced courses in finite combinatorics. Lint, Jacobus Hendricus van 1932- Erscheint auch als Druck-Ausgabe 9780521231411 |
spellingShingle | Cameron, Peter J. 1947- Graphs, codes, and designs |
title | Graphs, codes, and designs |
title_alt | Graphs, Codes & Designs |
title_auth | Graphs, codes, and designs |
title_exact_search | Graphs, codes, and designs |
title_full | Graphs, codes, and designs P.J. Cameron, J.H. van Lint |
title_fullStr | Graphs, codes, and designs P.J. Cameron, J.H. van Lint |
title_full_unstemmed | Graphs, codes, and designs P.J. Cameron, J.H. van Lint |
title_short | Graphs, codes, and designs |
title_sort | graphs codes and designs |
work_keys_str_mv | AT cameronpeterj graphscodesanddesigns AT lintjacobushendricusvan graphscodesanddesigns AT cameronpeterj graphscodesdesigns AT lintjacobushendricusvan graphscodesdesigns |