Seress / Arasu | Codes and Designs | Buch | 978-3-11-017396-3 | sack.de

Buch, Englisch, 322 Seiten, Format (B × H): 175 mm x 246 mm, Gewicht: 744 g

Reihe: ISSN

Seress / Arasu

Codes and Designs

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
Nachdruck 2012
ISBN: 978-3-11-017396-3
Verlag: De Gruyter

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

Buch, Englisch, 322 Seiten, Format (B × H): 175 mm x 246 mm, Gewicht: 744 g

Reihe: ISSN

ISBN: 978-3-11-017396-3
Verlag: De Gruyter


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 volulme 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.

Seress / Arasu Codes and Designs jetzt bestellen!

Zielgruppe


Graduate Students and Research Mathematicians


Autoren/Hrsg.


Weitere Infos & Material


Preface · Highlights of Dijen Ray-Chaudhuri's research
K. T. Arasu, Henk D. L. Hollmann, Kevin Player, and Qing Xiang: On the p-ranks of GMW difference sets · Sejeong Bang and Sung-Yell Song: Characterization of maximal rational circulant association schemes · Michel Deza: Face-regular polyhedra and tilings with two combinatorial types of faces · John F. Dillon: Geometry, codes and difference sets: exceptional connections · Jeffrey H. Dinitz and Douglas R. Stinson: A singular direct product for bicolorable Steiner triple systems · Dominic Elvira and Yutaka Hiramine: On semi-regular relative difference sets in non-abelian p-groups · Nick Fiala: Every l-design on 6p + 1 points is type-1 · Christian Fremuth-Paeger and Dieter Jungnickel: An introduction to balanced network flows · Derek W. Hein and Yury J. Ionin: On the l-design conjecture for n = 5p+1 points · Hadi Kharaghani and Vladimir D. Tonchev: On a class of twin balanced incomplete block designs ·Jon-Lark Kim and Vera Pless: Decoding some doubly-even self-dual [32,16,8] codes by hand · Donald L. Kreher and Rolf S. Rees: On the maximum size of a hole in an incomplete t-wise balanced design with specified minimum block size · Warwick de Launey: On a family of cocyclic Hadamard matrices · Akihiro Munemasa: A mass formula for Type II codes over finite fields of characteristic two · Erin J. Schram: A posteriori probability decoding through the discrete Fourier transform and the dual code · Mohan Shrikhande: Subdesigns of symmetric designs · Irfan Siap: Linear codes over F2+uF2 and their complete weight enumerators · N. J. A. Sloane: On single-deletion-correcting codes · Zhe-Xian Wan: Critical problems in finite vector spaces · Richard M. Wilson: Existence of Steiner systems that admit automorphisms with large cycles · Andrew J. Woldar: Rainbow graphs



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.