No abstract

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.1. INTRODUCTION. Coding theory has been extensively studied since 1948, when Claude Shannon [1948] proved in his seminal paper that linear codes can be used to reliably transmit information from a single source to a single receiver through a noisy channel. Since then, coding theory has found many important engineering applications. For example, coding theory has been used in designing reliable data storage systems, radio communication protocols, and in the emerging field of quantum computers. Coding theory has close ties with many areas in mathematics including linear algebra, commutative algebra, algebraic geometry, and combinatorics.In this note we introduce the new [Macaulay2] package called CodingTheory. The goal of this package is to provide a range of functions for constructing linear and evaluation codes over finite fields, and for computing some of their main properties. To this aim, we implement two types of objects, LinearCode and EvaluationCode. The package also includes implementations of functions for generating important families of linear codes like Hamming codes, cyclic codes, Reed-Solomon codes, Reed-Muller codes, Cartesian codes, monomial-Cartesian codes and toric codes. It also has functions for the syndrome decoding algorithm and locally recoverable codes.The organization of this note is as follows. In Section 2 we describe various ways to construct a linear code over a finite field using the CodingTheory package. In Section 3 we show how to compute the main parameters of a linear code: length, dimension, and minimum distance. We also illustrate how to

Abstract. Because of its interesting applications in coding theory, cryptography, and algebraic combinatorics, in recent decades a lot of attention has been paid to the algebraic structure of the ring of polynomials R [x], where R is a finite commutative ring with identity. Motivated by this popularity, in this paper we determine when R[x] is a principal ideal ring. In fact, we prove that R[x] is a principal ideal ring if and only if R is a finite direct product of finite fields. Keywords: Principal ideal ring, polynomial ring, finite rings. MSC2010: 13F10, 13F20, 16P10, 13C05. ¿Cuándo R[x] es un anillo de ideales principales?Resumen. Debido a sus interesantes aplicaciones en teoría de códigos, criptografía y combinatoria algebraica, en décadas recientes se ha incrementado la atención en la estructura algebraica del anillo de polinomios R[x], donde R es un anillo conmutativo finito con identidad. Motivados por esta popularidad, en este artículo determinamos cuándo R[x] es un anillo de ideales principales. De hecho, demostramos que R[x] es un anillo de ideales principales, si y sólo si, R es un producto directo finito de campos finitos. Palabras clave: Anillo de ideales principales, anillo de polinomios, anillos finitos.

No abstract

No abstract