Related papers: Higher weight spectra of Veronese codes
We determine the higher weight spectra of $q$-ary Reed-Muller codes $C_q=RM_q(2,2)$ for all prime powers $q$. This is equivalent to finding the usual weight distributions of all extension codes of $C_q$ over every field extension of $F_q$…
The problem studied in this work is to determine the higher weight spectra of the Projective Reed-Muller codes associated to the Veronese $3$-fold $\mathcal V$ in $PG(9,q)$, which is the image of the quadratic Veronese embedding of…
Given a constant weight linear code, we investigate its weight hierarchy and the Stanley-Reisner resolution of its associated matroid regarded as a simplicial complex. We also exhibit conditions on the higher weights sufficient to conclude…
Linearized Reed-Solomon codes are defined. Higher weight distribution of those codes are determined.
To each linear code over a finite field we associate the matroid of its parity check matrix. We show to what extent one can determine the generalized Hamming weights of the code (or defined for a matroid in general) from various sets of…
In this work, we determine new linear equations for the weight distribution of linear codes over finite chain rings. The identities are determined by counting the number of some special submatrices of the parity-check matrix of the code.…
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…
Let R > S be finite Frobenius rings for which there exists a trace map T from R onto S as left S modules. Let C:= {x -> T(ax + bf(x)) : a,b in R}. Then C is an S-linear subring-subcode of a left linear code over R. We consider functions f…
In this paper, we establish the matroid structures corresponding to data-local and local maximally recoverable codes (MRC). The matroid structures of these codes can be used to determine the associated Tutte polynomial. Greene proved that…
The study of the generalized Hamming weight of linear codes is a significant research topic in coding theory as it conveys the structural information of the codes and determines their performance in various applications. However,…
We consider $q$-matroids and their associated classical matroids derived from Gabidulin rank-metric codes. We express the generalized rank weights of a Gabidulin rank-metric code in terms of Betti numbers of the dual classical matroid…
In the recent work \cite{shi18}, a combinatorial problem concerning linear codes over a finite field $\F_q$ was introduced. In that work the authors studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero distinct…
We develop an algebraic theory of supports for $R$-linear codes of fixed length, where $R$ is a finite commutative unitary ring. A support naturally induces a notion of generalized weights and allows one to associate a monomial ideal to 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…
In this paper, we study the weight spectrum of linear codes with \emph{super-linear} field size and use the probabilistic method to show that for nearly all such codes, the corresponding weight spectrum is very close to that of a maximum…
A q-ary linear code of dimension k is called a maximum weight spectrum (MWS) code if it has the maximum possible number (viz. (q^k-1)/(q-1)) of different non-zero weights. We construct MWS codes from quasi-minimal codes, thus obtaining of…
We consider codes over $\mathbb{Z}_{p^s}$ with the extended Lee weight. We find Singleton bounds with respect to this weight and define MLDS and MLDR codes accordingly. We also consider the kernels of these codes and the notion of…
The Assmus-Mattson theorem gives a way to identify block designs arising from codes. This result was broadened to matroids and weighted designs. In this work we present a further two-fold generalisation: first from matroids to polymatroids…
In this paper, for an odd prime power $q$, we extend the construction of Xie et al. \cite{XOYM2023} to propose two classes of linear codes $\mathcal{C}_{Q}$ and $\mathcal{C}_{Q}'$ over the finite field $\mathbb{F}_{q}$ with at most four…
The weight spectra of MDS codes of length $ n $ and dimension $ k $ over the arbitrary alphabets are studied. For all $ q $-ary MDS codes of dimension $ k $ containing the zero codeword, it is shown that all $ k $ weights from $ n $ to $…