Related papers: Weight Enumerators and Cardinalities for Number-Th…
While quantum weight enumerators establish some of the best upper bounds on the minimum distance of quantum error-correcting codes, these bounds are not optimized to quantify the performance of quantum codes under the effect of arbitrary…
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…
In this work we explore a family of metrics over finite fields which respect the support of vectors. We show how these metrics can be obtained from the edge-weighted Hamming cube and, based on this representation we give a description of a…
It is well known that there is a deep relationship between codes and lattices. Concepts from coding theory are related to concepts of lattice theory as, for example, weight enumerators to theta series, MacWilliams identity to Jacobi…
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…
We consider the problem of evaluation of the weight enumerator of a binary linear code. We show that the exact evaluation is hard for polynomial hierarchy. More exactly, if WE is an oracle answering the solution of the evaluation problem…
A binary linear code is called {\em LCD} if it intersects its dual trivially. We show that the coefficients of the joint weight enumerator of such a code with its dual satisfy linear constraints, leading to a new linear programming bound on…
We study sequences of linear or affine codes with uniform weight spectrum, i.e., a part of codewords with any fixed weight tends to zero. It is proved that a sequence of linear codes has a uniform weight spectrum if the number of vectors…
This paper gives a brief survey of binary single-deletion-correcting codes. The Varshamov-Tenengolts codes appear to be optimal, but many interesting unsolved problems remain. The connections with shift-register sequences also remain…
In this work we develop a geometric approach to the study of rank metric codes. Using this method, we introduce a simpler definition for generalized rank weight of linear codes. We give a complete classification of constant rank weight code…
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…
Determining the weight distribution of a code is an old and fundamental topic in coding theory that has been thoroughly studied. In 1977, Helleseth, Kl{\o}ve, and Mykkeltveit presented a weight enumerator polynomial of the lifted code over…
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…
We give a quantum reduction from finding short codewords in a random linear code to decoding for the Hamming metric. This is the first time such a reduction (classical or quantum) has been obtained. Our reduction adapts to linear codes…
We propose a formulation of the Equivariant Tamagawa Number Conjecture for modular motives with coefficients in universal deformation rings and Hecke algebras; something which seems to have been heretofore missing because the complexes of…
We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…
Binary linear codes with good parameters have important applications in secret sharing schemes, authentication codes, association schemes, and consumer electronics and communications. In this paper, we construct several classes of binary…
We consider the geometric problem of determining the maximum number $n_q(r,h,f;s)$ of $(h-1)$-spaces in the projective space $\operatorname{PG}(r-1,q)$ such that each subspace of codimension $f$ does contain at most $s$ elements. In coding…
One of the most remarkable theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes. In the past 36 years there have been hundreds of papers written about generalizations and applications of this…
Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding is…