Vai al contenuto principale della pagina
Titolo: | Codes and designs [[electronic resource] ] : proceedings of a conference honoring Professor Dijen K. Ray-Chaudhuri on the occasion of his 65th birthday, The Ohio State University, May 18-21, 2000 / / editors, K.T. Arasu, A. Seress |
Pubblicazione: | Berlin ; ; New York, : Walter de Gruyter, 2002 |
Edizione: | Reprint 2012 |
Descrizione fisica: | 1 online resource (332 p.) |
Disciplina: | 003/.54 |
Soggetto topico: | Coding theory |
Combinatorial designs and configurations | |
Altri autori: | Ray-ChaudhuriDijen <1933-> ArasuK. T. <1954-> SeressÁkos <1958-> |
Note generali: | Description based upon print version of record. |
Nota di bibliografia: | Includes bibliographical references. |
Nota di contenuto: | Front matter -- Preface -- Table of contents -- Highlights of Dijen Ray-Chaudhuri's research / Seress, Ákos -- On the ρ-ranks of GMW difference sets / Arasu, Κ. T. / Hollmann, Henk D. L. / Player, Kevin / Xiang, Qing -- Characterization of maximal rational circulant association schemes / Bang, Sejeong / Song, Sung-Yell -- Face-regular polyhedra and tilings with two combinatorial types of faces / Deza, Michel -- Geometry, codes and difference sets: exceptional connections / Dillon, J. F. -- A singular direct product for bicolorable Steiner triple systems / Dinitz, Jeffrey H. / Stinson, Douglas R. -- On semi-regular relative difference sets in non-abelian ρ-groups / Elvira, Dominic / Hiramine, Yutaka -- Every λ-design on 6ρ + 1 points is type-1 / Fiala, Nick C. -- An introduction to balanced network flows / Fremuth-Paeger, Christian / Jungnickel, Dieter -- On the λ-design conjecture for ν = 5ρ + 1 points / Hein, Derek W. / Ionin, Yury J. -- On a class of twin balanced incomplete block designs / Kharaghani, Hadi / Tonchev, Vladimir D. -- Decoding some doubly-even self-dual [32,16, 8] codes by hand / Kim, Jon-Lark / Pless, Vera -- On the maximum size of a hole in an incomplete t-wise balanced design with specified minimum block size / Kreher, Donald L. / Rees, Rolf S. -- On a family of cocyclic Hadamard matrices / Launey, Warwick de -- A mass formula for Type II codes over finite fields of characteristic two / Munemasa, Akihiro -- A posteriori probability decoding through the discrete Fourier transform and the dual code / Schram, Erin J. -- Subdesigns of symmetric designs / Shrikhande, Mohan S. -- Linear codes over F2 + u F2 and their complete weight enumerators / Siap, Irfan -- On single-deletion-correcting codes / Sloane, N. J. A. -- Critical problems in finite vector spaces / Wan, Zhe-Xian -- Existence of Steiner systems that admit automorphisms with large cycles / Wilson, Richard M. -- Rainbow graphs / Woldar, Andrew J. |
Sommario/riassunto: | Following an initiative of the late Hans Zassenhaus in 1965, the Departments of Mathematics at The Ohio State University and Denison University organize conferences in combinatorics, group theory, and ring theory. Between May 18-21, 2000, the 25th conference of this series was held. Usually, there are twenty to thirty invited 20-minute talks in each of the three main areas. However, at the 2000 meeting, the combinatorics part of the conference was extended, to honor the 65th birthday of Professor Dijen Ray-Chaudhuri. This volume is the proceedings of this extension. Most of the papers are in coding theory and design theory, reflecting the major interest of Professor Ray-Chaudhuri, but there are articles on association schemes, algebraic graph theory, combinatorial geometry, and network flows as well. There are four surveys and seventeen research articles, and all of these went through a thorough refereeing process. The volume is primarily recommended for researchers and graduate students interested in new developments in coding theory and design theory. |
Titolo autorizzato: | Codes and designs |
ISBN: | 1-282-19436-4 |
9786612194368 | |
3-11-019811-8 | |
Formato: | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 9910782192303321 |
Lo trovi qui: | Univ. Federico II |
Opac: | Controlla la disponibilità qui |