Related papers: A distance-free approach to generalized weights
In this paper we investigate some dual algebraic-geometric codes associated with the Giulietti-Korchm\'aros maximal curve. We compute the minimum distance and the minimum weight codewords of such codes and we investigate the generalized…
We construct generalized symmetries for linearized Einstein gravity in arbitrary dimensions. First-principle considerations in QFT force generalized symmetries to appear in dual pairs. Verifying this prediction helps us find the full set of…
High order networks are weighted hypergraphs col- lecting relationships between elements of tuples, not necessarily pairs. Valid metric distances between high order networks have been defined but they are difficult to compute when the…
Reed-Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials, called skew Reed-Solomon codes, has already been introduced in the literature. In…
In this paper we study geometric aspects of codes in the sum-rank metric. We establish the geometric description of generalised weights, and analyse the Delsarte and geometric dual operations. We establish a correspondence between maximum…
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…
Upper bounds are given for the weight distribution of binary weakly self-dual codes. To get these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert spaces. This method is motivated by recent progress on…
We present a new approach to the calculation of measures in weighted networks, based on the translation of a weighted network into an ensemble of edges. This leads to a straightforward generalization of any measure defined on unweighted…
Motivated by a problem in computer architecture we introduce a notion of the perfect distance-dominating set, PDDS, in a graph. PDDSs constitute a generalization of perfect Lee codes, diameter perfect codes, as well as other codes and…
In this paper, several classes of three-weight codes and two-weight codes for the homogeneous metric over the chain ring $R=\mathbb{F}_p+u\mathbb{F}_p+\cdots +u^{k-1}\mathbb{F}_{p},$ with $u^k=0,$ are constructed, which generalises…
In this paper, several classes of three-weight codes and two-weight codes for the homogeneous metric over the chain ring $R=\mathbb{F}_p+u\mathbb{F}_p+\cdots +u^{k-1}\mathbb{F}_{p},$ with $u^k=0,$ are constructed, which generalises…
We use the relations between quadrics, trace codes and algebraic curves to construct algebraic curves over finite fields with many points and to compute generalized Hamming weights of codes.
A weight-dependent generalization of the binomial theorem for noncommuting variables is presented. This result extends the well-known binomial theorem for q-commuting variables by a generic weight function depending on two integers. For a…
Perfect codes are arguably the most fascinating structures in combinatorial coding theory, and their classification and weight distribution are of considerable interest. This classification also involves the analysis of some related…
Low check weight is practically crucial code property for fault-tolerant quantum computing, which underlies the strong interest in quantum low-density parity-check (qLDPC) codes. Here, we explore the theory of weight-constrained stabilizer…
We study growing networks in which each link carries a certain weight (randomly assigned at birth and fixed thereafter). The weight of a node is defined as the sum of the weights of the links attached to the node, and the network grows via…
We explicitly determine all the relative generalized Hamming weights of affine Cartesian codes using the notion of footprints and results from extremal combinatorics. This generalizes the previous works on the determination of relative…
Recent developments in storage -- especially in the area of resistive random access memory (ReRAM) -- are attempting to scale the storage density by regarding the information data as two-dimensional (2D), instead of one-dimensional (1D).…
The determination of the weight distribution of linear codes has been a fascinating problem since the very beginning of coding theory. There has been a lot of research on weight enumerators of special cases, such as self-dual codes and…
There have lately been several suggestions for parametrized distances on a graph that generalize the shortest path distance and the commute time or resistance distance. The need for developing such distances has risen from the observation…