## 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 (Google eBook)This volume contains 4 surveys and 17 refereed research articles on coding theory, design theory, association schemes, algebraic graph theory, combinatorial geometry, and network flows. It 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

We haven't found any reviews in the usual places.

### Contents

1 | |

9 | |

Characterization of maximal rational circulant association schemes | 37 |

Faceregular polyhedra and tilings with two combinatorial types of faces | 49 |

exceptional connections | 73 |

A singular direct product for bicolorable Steiner triple systems | 87 |

On semiregular relative difference sets in nonabelian pgroups | 99 |

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

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

On a family of cocyclic Hadamard matrices | 187 |

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

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

Subdesigns of symmetric designs | 237 |

Linear codes over F2 + uF2 and their complete weight 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 codes by hand | 165 |

Existence of Steiner systems that admit automorphisms with large cycles | 305 |

Rainbow graphs | 313 |

Backmatter | 321 |

### Common terms and phrases

2-byte weight enumerator 3-bicolorable 4-triakon A-design Algebra algorithm association schemes automorphism Baer subdesign Balanced network bifaced binary codes blocks cocyclic Codes and Designs codeword color columns combinatorial compute conjecture construction contains Corollary cyclic D. K. Ray-Chaudhuri decoding deﬁne defined deﬁnition denote direct product edges elements equation example exists extension group face-regular ﬁrst GMW difference sets Hadamard matrix Hence implies isomorphic Jungnickel latin square Lemma linear M. S. Shrikhande Math Mathematics Subject Classification node non-zero obtain orthogonal p-rank parameters parity partition permutation points polyhedra polynomial positive integer prime power problem Proof Proposition prove rainbow graph reestimation relative difference sets replication numbers respect result self-dual codes sequence Steiner systems Steiner triple systems subcode subdesigns of symmetric subgraph subgroup subsets symmetric designs Tanner graph Theorem 1.1 Theory tilings Type II codes unitary space vectors vertex vertices weight enumerator