Related papers: Free Resolutions and Generalized Hamming Weights o…
We construct two families of free resolutions that resolve the ideals of certain opposite Schubert varieties restricted to the big open cell. We conjecture that these examples have genericity properties translating to structure theorems for…
We present a new bound for the minimum distance of a general primary linear code. For affine variety codes defined from generalised C_{ab} curves the new bound often improves dramatically on the Feng-Rao bound for primary codes. The method…
Practically good error-correcting codes should have good parameters and efficient decoding algorithms. Some algebraically defined good codes such as cyclic codes, Reed-Solomon codes, and Reed-Muller codes have nice decoding algorithms.…
A celebrated theorem of Fr\"oberg gives a complete combinatorial classification of quadratic square-free monomial ideals with a linear resolution. A generalization of this theorem to higher degree square-free monomial ideals is an active…
Recently, some infinite families of minimal and optimal binary linear codes were constructed from simplicial complexes by Hyun {\em et al.} We extend this construction method to arbitrary posets. Especially, anti-chains are corresponded to…
In this paper, we examine a class of doubly resolvable combinatorial objects. Let $t, k, \lambda, s$ and $v$ be nonnegative integers, and let $X$ be a set of $v$ symbols. A generalized Howell design, denoted $t$-$GHD_{k}(s,v;\lambda)$, is…
In this note, we give a very simple description of the generalized Hamming weights of Reed--Muller codes. For this purpose, we generalize the well-known Macaulay representation of a nonnegative integer and state some of its basic…
For a graded ideal I in a graded ring, the deviation of I is defined as the difference between the minimal number of generators of I and its grade. In this article, we provide bigraded free resolutions of the symmetric algebras for specific…
In this short note we announce three formulas for the set of weights of various classes of highest weight modules $\V$ with highest weight \lambda, over a complex semisimple Lie algebra $\lie{g}$ with Cartan subalgebra $\lie{h}$. These…
Universal security over a network with linear network coding has been intensively studied. However, previous linear codes used for this purpose were linear over a larger field than that used on the network. In this work, we introduce new…
We use the lcm-lattice of a monomial ideal to study its minimal free resolutions. A new concept called a Taylor basis of a minimal free resolution is introduced and then used throughout the paper. We give a method of constructing minimal…
We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspond to a projective system containing all the points in a…
In this paper, we present the harmonic generalizations of well-known polynomials of codes over finite fields, namely the higher weight enumerators and the extended weight enumerators, and we derive the correspondences between these weight…
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. We show that for {\em every} code, the ratio of its list decoding radius to its minimum distance…
In this paper we prove parts of a conjecture of Herzog giving lower bounds on the rank of the free modules appearing in the linear strand of a graded $k$-th syzygy module over the polynomial ring. If in addition the module is…
The generalized covering radii (GCR) of linear codes are a fundamental higher-dimensional extension of the classical covering radius. While the second and third GCR of binary primitive double-error-correcting BCH codes, $\text{BCH}(2,m)$,…
The main objective of this paper is to generalize a notion of Koszul resolutions and charcterizing modules which admits such a resolution. We turn out that for a noetherian ring $A$ and a coherent $A$ module $M$, $M$ has a two dimensional…
Quantizing large language models has become a standard way to reduce their memory and computational costs. Typically, existing methods focus on breaking down the problem into individual layer-wise sub-problems, and minimizing per-layer…
Minimal rank-metric codes or, equivalently, linear cutting blocking sets are characterized in terms of the second generalized rank weight, via their connection with evasiveness properties of the associated $q$-system. Using this result, we…
Recently, linear codes constructed by defining sets have attracted a lot of study, and many optimal linear codes with a few weights have been produced. The objective of this paper is to present a class of binary linear codes with three…