Coding theory has developed alongside the use of communication. When communicating across a channel, it is inevitable that such pathways of communication be “noisy”. The absence of noise is virtually impossible to attain, thus there is always some sort of interference across the communication channel. This results in messages not always being received as they were originally sent. In order to solve these problems, coding theory developed. It is used both to detect and correct errors in a variety of codes. Coding theory has grown into a discipline affecting all sorts of areas including but not limited to computer science, mathematics, and engineering. The codes can be used for data compression (or source coding), error correction (or channel coding), cryptography and even network coding. Primarily in error correction do we find codes which we are able to transmit quickly, contain many codewords, and also can correct or detect many errors. Within this discipline, a concentration on algebraic coding theory lies with linear codes. There are a variety of different codes discovered within this set of linear codes, including cyclic and constacyclic codes. In this poster presentation, we will discuss the history of coding theory, going in depth with cyclic and constacyclic codes, as well as discussing the many applications and current problems being resolved using algebraic coding theory.