# Hiram H. LópezCleveland State University · Department of Mathematics

Hiram H. López

PhD in Mathematics

## About

44

Publications

3,986

Reads

**How we measure 'reads'**

A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more

332

Citations

Citations since 2017

Introduction

Additional affiliations

September 2012 - August 2016

September 2012 - May 2016

## Publications

Publications (44)

The relative hull of a code $C_1$ with respect to another code $C_2$ is the intersection $C_1\cap C_2^\perp$. We prove that the dimension of the relative hull can always be repeatedly reduced by one by replacing any of the two codes with an equivalent one, down to a specified lower bound. We show how to construct an equivalent code $C_1^\prime$ of...

This paper introduces decreasing norm-trace codes, which are evaluation codes defined by a set of monomials closed under divisibility and the rational points of the extended norm-trace curve. As a particular case, the decreasing norm-trace codes contain the one-point algebraic geometry (AG) codes over the extended norm-trace curve. We use Gr\"obner...

This work aims to obtain a sequence of 3D point clouds associated with a 3D object that reduces the volume data and preserves the shape of the original object. The sequence contains point clouds that give different simplifications of the object, from a very fine-tuned representation to a simple and sparse one. Such a sequence is important because i...

This work aims to algebraically describe the relative generalized Hamming weights of evaluation codes. We give a lower bound for these weights in terms of a footprint bound, and prove that this bound can be sharp. We compute the next-to-minimal weight of toric codes over hypersimplices of degree 1.

In this paper, we introduce multivariate Goppa codes, which contain, as a particular case, the well-known classical Goppa codes. We provide a parity check matrix for a multivariate Goppa code in terms of a tensor product of generalized Reed-Solomon codes. We prove that multivariate Goppa codes are subfield subcodes of augmented Cartesian codes. By...

A linear code is linear complementary dual, or LCD, if and only if the intersection between the code and its dual is trivial. Introduced by Massey in 1992, LCD codes have attracted recent attention due to their application. In this vein, Mesnager, Tang, and Qi considered complementary dual algebraic geometric codes, giving several examples from low...

The aim of this work is to algebraically describe the relative generalized Hamming weights of evaluation codes. We give a lower bound for these weights in terms of a footprint bound. We prove that this bound can be sharp. We compute the next-to-minimal weight of toric codes over hypersimplices of degree 1.

In this paper, we introduce multivariate Goppa codes, which contain as a special case the well-known, classical Goppa codes. We provide a parity check matrix for a multivariate Goppa code in terms of a tensor product of generalized Reed-Solomon codes. We prove that multivariate Goppa codes are subfield subcodes of augmented Cartesian codes. By show...

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 cons...

In this work, we present linear exact repair schemes for one or two erasures in decreasing monomial-Cartesian codes DM-CC, a family of codes which provides a framework for polar codes. In the case of two erasures, the positions of the erasures should satisfy a certain restriction. We present families of augmented Reed-Muller (ARM) and augmented Car...

Few decoding algorithms for hyperbolic codes are known in the literature, this article tries to fill this gap. The first part of this work compares hyperbolic codes and Reed-Muller codes. In particular, we determine when a Reed-Muller code is a hyperbolic code. As a byproduct, we state when a hyperbolic code has greater dimension than a Reed-Muller...

In this work, we present linear exact repair schemes for one or two erasures in decreasing monomial-Cartesian codes DM-CC, a family of codes which provides a framework for polar codes. In the case of two erasures, the positions of the erasures should satisfy a certain restriction. We present families of augmented Reed-Muller (ARM) and augmented Car...

The aim of this work is to study the dual and the algebraic dual of an evaluation code using standard monomials and indicator functions. We show that the dual of an evaluation code is the evaluation code of the algebraic dual. We develop an algorithm for computing a basis for the algebraic dual. Let C1 and C2 be linear codes spanned by standard mon...

In this paper, we construct codes for local recovery of erasures with high availability and constant-bounded rate from the Hermitian curve. These new codes, called Hermitian-lifted codes, are evaluation codes with evaluation set being the set of Fq2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepac...

In this paper, we introduce a new family of polar codes from evaluation codes, called polar decreasing monomial-Cartesian codes, and prove that families of polar codes with multiple kernels over certain symmetric channels can be viewed as polar decreasing monomial-Cartesian codes. This offers a unified treatment for such codes over any finite field...

The aim of this work is to study the dual and the algebraic dual of an evaluation code using standard monomials and indicator functions. We show that the dual of an evaluation code is the evaluation code of the algebraic dual. We develop an algorithm for computing a basis for the algebraic dual. Let $C_1$ and $C_2$ be linear codes spanned by standa...

In this paper, we study elements β ϵ Fqn having normal α-depth b; that is, elements for which β, β − α, . . . , β − (b − 1)α are simultaneously normal elements of Fqn over Fq. In [1], the authors present the definition of normal 1-depth but mistakenly present results for normal α-depth for some fixed normal element α ϵ Fqn . We explain this discrep...

This paper contributes to the study of rank-metric codes from an algebraic and combinatorial point of view. We introduce q-polymatroids, the q-analogue of polymatroids, and develop their basic properties. We associate a pair of q-polymatroids with a rank-metric code and show that several invariants and structural properties of the code, such as gen...

A monomial-Cartesian code is an evaluation code defined by evaluating a set of monomials over a Cartesian product. It is a generalization of some families of codes in the literature, for instance toric codes, affine Cartesian codes, and J-affine variety codes. In this work we use the vanishing ideal of the Cartesian product to give a description of...

In this Macaulay2 \cite{M2} package we define an object called {\it linear code}. 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 define an object {\it evaluation code}, a construction...

In this paper, we construct codes for local recovery of erasures with high availability and constant-bounded rate from the Hermitian curve. These new codes, called Hermitian-lifted codes, are evaluation codes with evaluation set being the set of $\mathbb{F}_{q^2}$-rational points on the affine curve. The novelty is in terms of the functions to be e...

We prove that families of polar codes with multiple kernels over certain symmetric channels can be viewed as polar decreasing monomial-Cartesian codes, offering a unified treatment for such codes, over any finite field. We define decreasing monomial-Cartesian codes as the evaluation of a set of monomials closed under divisibility over a Cartesian p...

A monomial-Cartesian code is an evaluation code defined by evaluating a set of monomials over a Cartesian product. It is a generalization of some families of codes in the literature, for instance toric codes, affine Cartesian codes and $J$-affine variety codes. In this work we use the vanishing ideal of the Cartesian product to give a description o...

A linear code C with the property that C∩C⊥={0} is said to be a linear complementary dual, or LCD, code. In this paper, we consider generalized affine Cartesian codes which are LCD. Generalized affine Cartesian codes arise naturally as the duals of affine Cartesian codes in the same way that generalized Reed–Solomon codes arise as duals of Reed–Sol...

There are many applications in different fields, as diverse as computer graphics, medical imaging or pattern recognition for industries, where the use of three dimensional objects is needed. By the nature of these objects, it is very important to develop thrifty methods to represent, study and store them. In this paper, a new method to encode surfa...

Locally repairable codes (LRCs) have received significant recent attention as a method of designing data storage systems robust to server failure. Optimal LRCs offer the ideal trade-off between minimum distance and locality, a measure of the cost of repairing a single codeword symbol. For optimal LRCs with minimum distance greater than or equal to...

A linear code $C$ with the property that $C \cap C^{\perp} = \{0 \}$ is said to be a linear complementary dual, or LCD, code. In this paper, we consider generalized affine Cartesian codes which are LCD. Generalized affine Cartesian codes arise naturally as the duals of affine Cartesian codes in the same way that generalized Reed-Solomon codes arise...

In analogy with the Singleton defect for classical codes, we propose a definition of rank defect for rank-metric codes. We characterize codes whose rank defect and dual rank defect are both zero, and prove that the rank distribution of such codes is determined by their parameters. This extends a result by Delsarte on the rank distribution of MRD co...

We approach the problem of linear network coding for multicast networks from different perspectives. We introduce the notion of the coding points of a network, which are edges of the network where messages combine and coding occurs. We give an integer linear program that leads to choices of paths through the network that minimize the number of codi...

We approach the problem of linear network coding for multicast networks from different perspectives. We introduce the notion of the coding points of a network, which are edges of the network where messages combine and coding occurs. We give an integer linear program that leads to choices of paths through the network that minimize the number of codi...

We approach the problem of linear network coding for multicast networks from different perspectives. We introduce the notion of the coding points of a network, which are edges of the network where messages combine and coding occurs. We give an integer linear program that leads to choices of paths through the network that minimize the number of codi...

A chain code is a common, compact and size-efficient way to represent the contour shape of an object. When a group of objects is studied using chain codes, previous works require to obtain one chain code for each object. In this paper we assign a single chain to a group of objects, in such a way that all the properties of each object of the group c...

In analogy with the Singleton defect for classical codes, we propose a
definition of rank defect for Delsarte rank-metric codes. We characterize codes
whose rank defect and dual rank defect are both zero, and prove that the rank
distribution of such codes is determined by their parameters. This extends a
result by Delsarte on the rank distribution...

In this paper we introduce a new type of code, called projective nested
cartesian code. It is obtained by the evaluation of homogeneous polynomials of
a fixed degree on a certain subset of $\mathbb{P}^n(\mathbb{F}_q)$, and they
may be seen as a generalization of the so-called projective Reed-Muller codes.
We calculate the length and the dimension o...

The representation of images is an active and very important area in image processing and pattern recognition. Therefore, in the literature, different contour codes for binary images have been proposed, such as F4; F8;VCC; 3OT, and AF8. These codes have been used in many papers since the first chain code, F8, was introduced by Freeman in 1961. All...

A new chain code to represent 3D discrete curves is proposed. The method is based on a search for relative changes in the 3D Euclidean space, composed of three main vectors: a reference vector, a support vector, and a change direction vector, utilized to obtain a directed simple path in a grid of 26 connected components. A set of rotation transform...

We study the complete intersection property and the algebraic invariants
(index of regularity, degree) of vanishing ideals on degenerate tori over
finite fields. We establish a correspondence between vanishing ideals and toric
ideals associated to numerical semigroups. This correspondence is shown to
preserve the complete intersection property, and...

We show that the degree of a graded lattice ideal of dimension 1 is the order
of the torsion subgroup of the quotient group of the lattice. This gives an
efficient method to compute the degree of this type of lattice ideals.

For the family of graded lattice ideals of dimension 1, we establish a
complete intersection criterion in algebraic and geometric terms. In positive
characteristic, it is shown that all ideals of this family are binomial set
theoretic complete intersections. In characteristic zero, we show that an
arbitrary lattice ideal which is a binomial set the...

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 integers, we construct an evaluation code, over a
degenerate torus, with prescribed parameters. As an application of our results,
we recover the formulas for the minimum distanc...

Let K be a finite field and let X* be an affine algebraic toric set
parameterized by monomials. We give an algebraic method, using Groebner bases,
to compute the length and the dimension of C_X*(d), the parameterized affine
code of degree d on the set X*. If Y is the projective closure of X*, it is
shown that C_X^*(d) has the same basic parameters...