We will review recent research on combinatorial problems in perfect 1-error-correcting (non-linear) binary codes. This will include recent work on rank and kernals of such codes, nonsystematic codes and the connection to resilient functions, equivalence classes and methods for determining them, and partitions of n-space by perfect codes.

Back to Workshop Schedule