Related papers: Binary Linear Codes, Dimers and Hypermatrices
We answer a question in [Landsberg, Ressayre, 2015], showing the regular determinantal complexity of the determinant det_m is O(m^3). We answer questions in, and generalize results of [Aravind, Joglekar, 2015], showing there is no rank one…
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…
We prove that for any $\lambda > 1$, fixed in advance, the permanent of an $n \times n$ complex matrix, where the absolute value of each diagonal entry is at least $\lambda$ times bigger than the sum of the absolute values of all other…
We introduce a general class of regular weight functions on finite abelian groups, and study the combinatorics, the duality theory, and the metric properties of codes endowed with such functions. The weights are obtained by composing a…
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…
The Hamming weight enumerator function of the formally self-dual even, binary extended quadratic residue code of prime p = 8m + 1 is given by Gleason's theorem for singly-even code. Using this theorem, the Hamming weight distribution of the…
We say that a linear code C over a field F is triangular representable if there exists a two dimensional simplicial complex $\Delta$ such that C is a punctured code of the kernel ker $\Delta$ of the incidence matrix of $\Delta$ over F and…
Motivated by applications in polymer-based data storage we introduced the new problem of characterizing the code rate and designing constant-weight binary $B_2$-sequences. Binary $B_2$-sequences are collections of binary strings of length…
We investigate the packing and covering densities of linear and nonlinear binary codes, and establish a number of duality relationships between the packing and covering problems. Specifically, we prove that if almost all codes (in the class…
Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in…
We introduce new sufficient conditions for permutation and monomial equivalence of linear cyclic codes over various finite fields. We recall that monomial equivalence and isometric equivalence are the same relation for linear codes over…
The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that…
Let $H$ be a complex Hilbert space and let ${\mathcal P}(H)$ be the associated projective space (the set of rank-one projections). Suppose that $\dim H\ge 3$. We prove the following Wigner-type theorem: if $H$ is finite-dimensional, then…
In this work, we consider tilings of the Hamming cube and look for metrics which turn the tilings into a perfect code. We consider the family of metrics which are determined by a weight and are compatible with the support of vectors…
In this paper, we give some determinantal and permanental representations of Generalized Lucas Polynomials by using various Hessenberg matrices, which are general form of determinantal and permanental representations of ordinary Lucas and…
In this paper, we have introduced the concepts of support distribution and the support enumerator as refinements of the classical weight distribution and weight enumerator respectively, capturing coordinate level activity in linear block…
The weight hierarchy of a linear code has been an important research topic in coding theory since Wei's original work in 1991. Choosing $ D=\Big\{(x,y)\in \Big(\F_{p^{s_1}}\times\F_{p^{s_2}}\Big)\Big\backslash\{(0,0)\}: f(x)+g(y)=0\Big\}$…
Trigonometric integrators for oscillatory linear Hamiltonian differential equations are considered. Under a condition of Hairer & Lubich on the filter functions in the method, a modified energy is derived that is exactly preserved by…
We study hyperbolic polynomials with nice symmetry and express them as the determinant of a Hermitian matrix with special structure. The goal of this paper is to answer a question posed by Chien and Nakazato in 2015. By properly modifying a…
The $\Z_{2^s}$-additive codes are subgroups of $\Z^n_{2^s}$, and can be seen as a generalization of linear codes over $\Z_2$ and $\Z_4$. A $\Z_{2^s}$-linear code is a binary code which is the Gray map image of a $\Z_{2^s}$-additive code. We…