Related papers: Free Resolutions and Generalized Hamming Weights o…
This paper proposes a generic formulation that significantly expedites the training and deployment of image classification models, particularly under the scenarios of many image categories and high feature dimensions. As a defining…
Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of two-weight and three-weight linear codes are presented and their…
A linear code of length $n$ over a finite chain ring $R$ with residue field $\F_q$ is a $R$-submodule of $R^n$. A $R$-linear code is a code over $\F_q$ (not necessarily linear) which is the generalized Gray map image of a linear code over…
A combinatorial problem concerning the maximum size of the (hamming) weight set of an $[n,k]_q$ linear code was recently introduced. Codes attaining the established upper bound are the Maximum Weight Spectrum (MWS) codes. Those $[n,k]_q $…
This work develops new foundations for the theory of linear codes over local Artinian commutative rings. We use algebraic invariants such as the socle, type, length, and minimal number of generators to measure the size of codes. We prove a…
We study monomial ideals with linear presentation or partially linear resolution. We give combinatorial characterizations of linear presentation for square-free ideals of degree 3, and for primary ideals whose resolutions are linear except…
Using the notion of generalized weight we improve estimates on the parameters of quantum codes obtained by Steane's construction from binary codes. This yields several new families of quantum codes.
It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear…
This paper is concerned with the combinatorial description of the graded minimal free resolution of certain monomial algebras which includes toric rings. Concretely, we explicitly describe how the graded minimal free resolution of those…
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…
We consider the problem of constructing deletion correcting codes over a binary alphabet and take a graph theoretic view. An $n$-bit $s$-deletion correcting code is an independent set in a particular graph. We propose constructing such a…
This paper studies the algebraic structure of a new class of hyperplane arrangement $A$ obtained by deleting two hyperplanes from a free arrangement. We provide information on the minimal free resolutions of the logarithmic derivation…
In $1991$, Wei proved a duality theorem that established an interesting connection between the generalized Hamming weights of a linear code and those of its dual code. Wei's duality theorem has since been extensively studied from different…
Given an arbitrary field k and an arithmetic sequence of positive integers m_0<...<m_n, we consider the affine monomial curve parameterized by X_0=t^{m_0},...,X_n=t^{m_n}. In this paper, we conjecture that the Betti numbers of its…
Linear codes with a few weights can be applied to communication, consumer electronics and data storage system. In addition, the weight hierarchy of linear codes has many applications such as on the type II wire-tap channel, dealing with…
We investigate the standard generalized Gorenstein algebras of homological dimension three, giving a structure theorem for their resolutions. Moreover in many cases we are able to give a complete description of their graded Betti numbers.
Linear codes over finite rings become one of hot topics in coding theory after Hommons et al.([4], 1994) discovered that several remarkable nonlinear binary codes with some linear-like properties are the images of Gray map of linear codes…
Combinatorial designs are closely related to linear codes. In recent year, there are a lot of $t$-designs constructed from certain linear codes. In this paper, we aim to construct $2$-designs from binary three-weight codes. For any binary…
Given a monomial ideal in a polynomial ring over a field, we define the generalized Newton complementary dual of the given ideal. We show good properties of such duals including linear quotients and isomorphisms between the special fiber…
In \cite{shi2022few-weight}, Shi and Li studied $\mathcal{C}_D$-codes over the ring $\mathcal{R}:=\mathbb{F}_2[x,y]/\langle x^2, y^2, xy-yx\rangle$ and their binary Gray images, where $D$ is derived using certain simplicial complexes. We…