The main purpose of this book is to introduce algebraic, combinatorial, and computational
methods to study monomial algebras and their presentation ideals, including Stanley …

We compute the basic parameters (dimension, length, minimum distance) of affine
evaluation codes defined on a cartesian product of finite sets. Given a sequence of positive …

In this paper we give a formula for the second generalized Hamming weight of certain
evaluation codes arising from a projective torus. This allows us to compute the …

На протяжении долгого времени стоматологи ищут способы борьбы с кариесом,
однако это заболевание до сих пор является самым распространённым среди …

We obtain certain algebraic invariants relevant in studying codes on subgroups of weighted
projective tori inside an n-dimensional weighted projective space. As application, we …

In this paper we find the complete weight hierarchy of the codes parameterized by the edges
of the cycle C 4 and an upper bound in the case of the complete bipartite graph K 2, n …

Let K= F q be a finite field. We introduce a family of projective Reed–Muller-type codes
called projective Segre codes. Using commutative algebra and linear algebra methods, we …

In this paper we find some bounds for the relative generalized Hamming weights of some
codes parameterized by a set of monomials of the same degree. Also we compare the …

In this paper we introduce the relative generalized minimum distance function (RGMDF for
short) and it allows us to give an algebraic approach to the relative generalized Hamming …