Speaker:  Peter Dukes, University of Toronto
Time:     Monday, October 20, 11:00-12:00
Place:    Room STE-1010, SITE, University of Ottawa
Title:    Constant composition codes

Abstract:
A code of length n over the alphabet {1,...,k} is said to have
constant composition [n_1,...,n_k] if every codeword has n_i
occurrences of symbol i for i=1,...,k.  Special cases are the
constant weight binary codes (k=2) and permutation codes (n_i=1 for
all i).  In this talk, a recursive construction for constant composition
codes will be presented.  Also, various direct (algebraic and
design-theoretic) constructions will be explored for compositions and
distances of particular interest.
This is joint work with Wensong Chu and Charles Colbourn.