Related papers: The dual of an evaluation code
In the present paper, we derive formulas of complex and $\ell$-adic multiple polylogarithms, which have two aspects: a duality in terms of indexes and a reflection in terms of variables. We provide an algebraic proof of these formulas by…
Consider a complete flag $\{0\} = C_0 < C_1 < \cdots < C_n = \mathbb{F}^n$ of one-point AG codes of length $n$ over the finite field $\mathbb{F}$. The codes are defined by evaluating functions with poles at a given point $Q$ in points…
Based on the partition of parameter space, two algorithms for computing the rational univariate representation of zero-dimensional ideals with parameters are presented in the paper. Unlike the rational univariate representation of…
Closure operations such as tight and integral closure and test ideals have appeared frequently in the study of commutative algebra. This articles serves as a survey of the authors' prior results connecting closure operations, test ideals,…
An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be…
In the theory of persistent homology, a well known duality relates the barcodes of the absolute homology and relative cohomology of a one-parameter simplicial filtration. Motivated by the problem of computing free presentations of the…
In this paper, several conjectures proposed in [2] are studied, involving the equivalence and duality of polycyclic codes associated with trinomials. According to the results, we give methods to construct isodual and self-dual polycyclic…
We introduce a notion of ``$n$-dual'' to a simplicial vector space for $n\ge 0$. Coming with it, there is a canonical pairing, which we show to be non-degenerate up to homotopy for homotopy $n$-types. As a result this notion of duality is…
In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters…
A simple formula computing the multiplier ideal of a monomial ideal on an arbitrary affine toric variety is given. Variants for the multiplier module and test ideals are also treated.
MDS self-dual codes have good algebraic structure, and their parameters are completely determined by the code length. In recent years, the construction of MDS Euclidean self-dual codes with new lengths has become an important issue in…
In semidefinite programming the dual may fail to attain its optimal value and there could be a duality gap, i.e., the primal and dual optimal values may differ. In a striking paper, Ramana proposed a polynomial size extended dual that does…
Macaulay dual spaces provide a local description of an affine scheme and give rise to computational machinery that is compatible with the methods of numerical algebraic geometry. We introduce eliminating dual spaces, use them for computing…
Each linear code can be described by a code ideal given as the sum of a toric ideal and a non-prime ideal. In this way, several concepts from the theory of toric ideals can be translated into the setting of code ideals. It will be shown…
The primary goal of this paper is to explicitly write down all semisimple dual pairs in the exceptional Lie algebras. (A dual pair in a reductive Lie algebra $\mathfrak{g}$ is a pair of subalgebras such that each member equals the other's…
Bar Codes are combinatorial objects encoding many properties of monomial ideals. In this paper we employ these objects to study Janet-like divisions. Given a finite set of terms U, from its Bar Code we can compute the Janet-like…
The choice of an isomorphism, a duality, between a finite abelian group $A$ and its character group allows one to define dual codes of additive codes over $A$. Properties of dualities and dual codes are studied, continuing work of Delsarte…
We develop a method to construct elusive functions using techniques of commutative algebra and algebraic geometry. The key notions of this method are elusive subsets and evaluation mappings. We also develop the effective elimination theory…
Polar codes form a very powerful family of codes with a low complexity decoding algorithm that attain many information theoretic limits in error correction and source coding. These codes are closely related to Reed-Muller codes because both…
In this paper, we study two ways of evaluating iterated Ore polynomials. We provide many examples and compare these evaluations. We use the evaluation maps to construct Reed-Muller codes and compute explicitly some of the data that are…