Coding theory package for Macaulay2

In this Macaulay2 package we implement a type of object called a LinearCode. We implement functions that compute basic parameters and objects associated with a linear code, such as generator and parity check matrices, the dual code, length, dimension, and minimum distance, among others. We implement a type of object called an EvaluationCode, a construction which allows users to study linear codes using tools of algebraic geometry and commutative algebra. We implement functions to generate important families of linear codes, such as Hamming codes, cyclic codes, Reed–Solomon codes, Reed–Muller codes, Cartesian codes, monomial–Cartesian codes, and toric codes. In addition, we implement functions for the syndrome decoding algorithm and locally recoverable code construction, which are important tools in applications of linear codes.