Projections on Codes
Prof. Keith Mellinger, University of Illinois at Chicago
Monday April 22

Abstract. The construction of good binary (linear) codes from shorter codes has been widely studied by coding theorists. One motivation is to lower the decoding complexity of the original code. We will start with a survey of the theory of error-correcting codes. After taking a look at the main problems, notations, and techniques, we will look at examples of codes and discuss some of the current applications and trends in the research. From there, we will discuss a certain projection technique whereby one can obtain an additive code over GF(4) from a binary linear code of longer length. We generalize the projection, look at several examples, and discuss the associated automorphism groups. This talk will be accessible to a diverse audience.

This talk is jointly organized with Applied Mathmatics Seminar.

Announcement Poster in PDF