## 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, 2000Following 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. |

### What people are saying - Write a review

### Contents

Highlights of Dijen RayChaudhuris research | 1 |

On the pranks of GMW difference sets | 9 |

Characterization of maximal rational circulantassociation schemes | 37 |

Faceregular polyhedra and tilings with twocombinatorial types of faces | 49 |

exceptional connections | 73 |

A singular direct product for bicolorableSteiner triple systems | 87 |

On semiregular relative difference setsin nonabelian pgroups | 99 |

Every λdesign on 6p + 1 points is type1 | 109 |

On the maximum size of a hole in an incomplete twisebalanced design with specified minimum block size | 179 |

On a family of cocyclic Hadamard matrices | 187 |

A mass formula for Type II codes over finite fieldsof characteristic two | 207 |

A posteriori probability decoding through the discreteFourier transform and the dual code | 215 |

Subdesigns of symmetric designs | 237 |

Linear codes over F2 + uF2 and their completeweight enumerators | 259 |

On singledeletioncorrecting codes | 273 |

Critical problems in finite vector spaces | 293 |

An introduction to balanced network flows | 125 |

On the λdesign conjecture for v 5p + 1 points | 145 |

On a class of twin balanced incomplete block designs | 157 |

Decoding some doublyeven selfdual 32 16 8 codesby hand | 165 |

Existence of Steiner systems that admit automorphismswith large cycles | 305 |

Rainbow graphs | 313 |