Tables of Conflict-Avoiding Codes
The following tables of conflict-avoiding codes
were computed by Susan R. Janiszewski
and Amin Y. Teymorian
during the NSF sponsored REU program held
at Michigan Technological University in the summer of 2005.
A graph having as vertices orbit representatives of
k-subsets under the cyclic group of order n
was used to reduce the problem of finding a conflict-avoiding
code of length n for k active users to finding cliques
of maximum size.
A reduced graph that involves only orbits that correspond to symmetric
circulants was used to compute centered codes.