Related papers: On the Griesmer bound for nonlinear codes
We obtain a sharp upper bound for the length of arbitrary non-associative algebra and present an example demonstrating the sharpness of our bound. To show this we introduce a new method of characteristic sequences based on linear algebra…
An open question about Gabidulin codes is whether polynomial-time list decoding beyond half the minimum distance is possible or not. In this contribution, we give a lower and an upper bound on the list size, i.e., the number of codewords in…
We show that within any quantum stabilizer code there lurks a classical binary linear code with similar error-correcting capabilities, thereby demonstrating new connections between quantum codes and classical codes. Using this result --…
Cyclic codes with a few weights are very useful in the design of frequency hopping sequences and the development of secret sharing schemes. In this paper, we mainly use Gauss sums to represent the Hamming weights of a general construction…
We investigate the existence of multiple bound states of prescribed mass for the nonlinear Schr\"odinger equation on a noncompact metric graph. The main feature is that the nonlinearity is localized only in a compact part of the graph. Our…
Cyclic boundaries are used in many branches of physics and mathematics, typically to assist the approximation of a large space. We show that when determining the performance of planar, fault-tolerant, topological quantum error correction,…
We consider a semilinear Neumann problem with exponential nonlinearity in a smooth bounded domain $\Omega \subset \mathbb{R}^2$. We prove that there exists a threshold $\bar{\varepsilon}>0$ such that for all $\varepsilon>\bar{\varepsilon}$,…
In this paper, we present a unified general non-strict Finsler lemma. This result is general in the sense that it does not impose any restrictions on the involved matrices and, thereby, it encompasses all existing non-strict versions of…
We exhibit several counterexamples showing that the famous Serrin's symmetry result for semilinear elliptic overdetermined problems may not hold for partially overdetermined problems, that is when both Dirichlet and Neumann boundary…
We introduce a linear programming method to obtain bounds on the cardinality of codes in Grassmannian spaces for the chordal distance. We obtain explicit bounds, and an asymptotic bound that improves on the Hamming bound. Our approach…
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…
In this paper, we show that LCD codes are not equivalent to linear codes over small finite fields. The enumeration of binary optimal LCD codes is obtained. We also get the exact value of LD$(n,2)$ over $\mathbb{F}_3$ and $\mathbb{F}_4$. We…
So far, there is no polynomial-time list decoding algorithm (beyond half the minimum distance) for Gabidulin codes. These codes can be seen as the rank-metric equivalent of Reed--Solomon codes. In this paper, we provide bounds on the list…
In a {\em locally recoverable} or {\em repairable} code, any symbol of a codeword can be recovered by reading only a small (constant) number of other symbols. The notion of local recoverability is important in the area of distributed…
In this paper we study quasilinear elliptic systems with nonlinear boundary condition with fully coupled perturbations even on the boundary. Under very general assumptions our main result says that each weak solution of such systems belongs…
The Gilbert-Varshamov bound states that the maximum size A_2(n,d) of a binary code of length n and minimum distance d satisfies A_2(n,d) >= 2^n/V(n,d-1) where V(n,d) stands for the volume of a Hamming ball of radius d. Recently Jiang and…
Blocking sets and minimal codes have been studied for many years in projective geometry and coding theory. In this paper, we provide a new lower bound on the size of $t$-fold $s$-blocking sets without the condition $t \leq q$, which is…
A convex code is a binary code generated by the pattern of intersections of a collection of open convex sets in some Euclidean space. Convex codes are relevant to neuroscience as they arise from the activity of neurons that have convex…
The parameters of a nondegenerate quantum code must obey the Hamming bound. An important open problem in quantum coding theory is whether or not the parameters of a degenerate quantum code can violate this bound for nondegenerate quantum…
An apriori bound for the condition number associated to each of the following problems is given: general linear equation solving, minimum squares, non-symmetric eigenvalue problems, solving univariate polynomials, solving systems of…