Beginning with the realization that several important binary codes were the images of the ring of integers modulo 4, the study of codes over rings has become an increasingly important    area in coding theory. Many ideas of coding theory have been translated to Galois rings, chain rings, and principal ideal rings. It has been shown in a series of papers that it is natural to study codes over Frobenius rings, as these rings represent the largest class for which both MacWilliams theorems apply. The course focuses on the study of local Frobenius rings (from both theoretical and computational perspectives) and explores their applications in coding theory, utilizing the computer algebra system SAGE for computational purposes.