Related papers: An explicit formula for a weight enumerator of lin…
We interpret the symmetrized weight enumerator of linear codes over finite commutative Frobenius rings as a summation over multisets and thereby provide a new proof of the MacWilliams identity for the symmetrized weight enumerator. The…
In this paper, the necessity theory for commutators of multilinear singular integral operators on weighted Lebesgue spaces is investigated. The results relax the restriction of the weights class to the general multiple weights, which can be…
Motivated by the works of Shiromoto [3] and Shi et al. [4], we study the existence of MacWilliams type identities with respect to Lee and Euclidean weight enumerators for linear codes over $\mathbb{Z}_{\ell}.$ Necessary and sufficient…
By bivariate irreducible representations of ${\rm Sp}(2r)$, we mean irreducible representations with highest weights containing at most two nonzero entries, using the usual identification of dominant weights for complex symplectic Lie…
It is known that for binary codes one can use Gr\"obner bases to obtain a subset of codewords of minimal support that can be used to determine the second generalized Hamming weight of the code. In this paper we establish conditions on a…
Cyclic codes have been widely used in digital communication systems and consume electronics as they have efficient encoding and decoding algorithms. The weight distribution of cyclic codes has been an important topic of study for many…
We provide a computational definition of the notions of vector space and bilinear functions. We use this result to introduce a minimal language combining higher-order computation and linear algebra. This language extends the Lambda-calculus…
We establish a formula for the weight multiplicities of Demazure modules (in particular for highest weight representations) of a complex connected algebraic group in terms of the geometry of its Langlands dual.
This work addresses an enumeration problem on weighted bi-colored plane trees with prescribed vertex data, with all vertices labeled distinctly. We give a bijection proof of the enumeration formula originally due to Kochetkov, hence…
In a previous paper, we obtained several "compact versions" of Rubio de Francia's weighted extrapolation theorem, which allowed us to extrapolate the compactness of linear operators from just one space to the full range of weighted Lebesgue…
In this article we determine several theorems and methods for solving linear congruences and systems of linear congruences, and we find the number of distinct solutions. Many examples of solving congruences are given.
We establish a connection between linear codes and hyperplane arrangements using the Thomas decomposition of polynomial systems and the resulting counting polynomial. This yields both a generalization and a refinement of the weight…
In previous work, we demonstrated how decoding of a non-binary linear code could be formulated as a linear-programming problem. In this paper, we study different polytopes for use with linear-programming decoding, and show that for many…
For any q which is a power of 2 we describe a finite subgroup of the group of invertible complex q by q matrices under which the complete weight enumerators of generalized doubly-even self-dual codes over the field with q elements are…
We determine a condition on the minimum Hamming weight of some special abelian group codes and, as a consequence of this result, we establish that any such code is, up to permutational equivalence, a subspace of the direct sum of $s$ copies…
Since MacWilliams proved the original identity relating the Hamming weight enumerator of a linear code to the weight enumerator of its dual code there have been many different generalizations, leading to the development of $m$-tuple support…
Multi-class classification is mandatory for real world problems and one of promising techniques for multi-class classification is Error Correcting Output Code. We propose a method for constructing the Error Correcting Output Code to obtain…
Recently, minimal linear codes have been extensively studied due to their applications in secret sharing schemes, secure two-party computations, and so on. Constructing minimal linear codes violating the Ashikhmin-Barg condition and then…
We give recurrences, generating functions and explicit exact expressions for the enumeration of fundamental quantities involving runs in binary strings. We first focus on enumerations concerning runs of ones, and we then analyse the same…
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].…