Abstract
Authentication codes have been developed since 1974, while error correcting codes have a longer history. There are several approaches to the construction of authentication codes without secrecy using error correcting codes. In this thesis, we present three constructions which are generalizations of some known constructions. Within the frameworks, we construct several classes of authentication codes via certain types of error correcting codes. Some authentication codes are better than known ones with comparable parameters. Others which cannot be compared with existing ones are asymptotically optimal. We also present a generic construction of authentication codes which are optimal with respect to several bounds.