Combinatorial designs originated from statistical design of experiments, and have many applications in theoretical computer science, e.g. authentication scheme, partial match queries on files, software testing, and numerical integration. In this talk, we consider some optical and wireless multiple-access communication systems, in which the users want to share a common communication channel. The users may be active or inactive. If two or more active users access the channel at the same time, some collision will occur. The resource sharing problems are then formulated as combinatorial packing problems, and some optimal code design will be presented
Kenneth Shum (沈穎祺) received the B.Eng. degree in information engineering from the Chinese University of Hong Kong in 1993, and the M.S. and Ph.D. degrees in electrical engineering from the University of Southern California in 1995 and 2000, respectively. He is now a research associate professor with the Institute of Network Coding, the Chinese University of Hong Kong. His research interests include information theory and coding for distributed storage systems.