Related papers: A Singleton Bound for Lattice Schemes
Lattice results, kinematical constraints and QCD dispersion relations are combined for the first time to derive model-independent bounds for QCD form factors and corresponding rates. To take into account the error bars on the lattice…
In this work, we study the codes over the integers with locality constraints. We introduce a weighted notion of locality over $\mathbb{Z}/q_1\mathbb{Z} \times \cdots \times \mathbb{Z}/q_n\mathbb{Z}$ and derive a Singleton-like bound for…
New exact modular branching rules are obtained for modules over the symmetric groups that are close to completely splittable modules. These results are based on some upper bounds for the Ext^1-spaces between simple modules.
In this article, we study new methods for constructing uninorms on bounded lattices. First, we present new methods for constructing uninorms on bounded lattices under the additional constraints and prove that some of these constraints are…
We derive bounds on the asymptotic density of parity-check matrices and the achievable rates of binary linear block codes transmitted over memoryless binary-input output-symmetric (MBIOS) channels. The lower bounds on the density of…
The symbol-pair codes over finite fields have been raised for symbol-pair read channels and motivated by application of high-density data storage technologies [1, 2]. Their generalization is the code for b-symbol read channels (b > 2). Many…
A new achievable rate region is given for the Gaussian cognitive many-to-one interference channel. The proposed novel coding scheme is based on the compute-and-forward approach with lattice codes. Using the idea of decoding sums of…
The homogeneous metric can be viewed as a natural extension of the Hamming metric to finite chain rings. It distinguishes between three types of elements: zero, non-zero elements in the socle, and elements outside the socle. Since the…
Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study…
List-decoding of Reed-Solomon (RS) codes beyond the so called Johnson radius has been one of the main open questions since the work of Guruswami and Sudan. It is now known by the work of Rudra and Wootters, using techniques from high…
We address the maximum size of binary codes and binary constant weight codes with few distances. Previous works established a number of bounds for these quantities as well as the exact values for a range of small code lengths. As our main…
We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distances, and universal lower bounds on the potential energy…
Delsarte's method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that…
We obtain some rigidity results for overdetermined boundary value problems for singular solutions in bounded domains.
We study the influence of geometry on semilinear elliptic equations of bistable or nonlinear-field type in unbounded domains. We discover a surprising dichotomy between epigraphs that are bounded from below and those that contain a cone of…
Self-orthogonal codes are a subclass of linear codes that are contained within their dual codes. Since self-orthogonal codes are widely used in quantum codes, lattice theory and linear complementary dual (LCD) codes, they have received…
In this article we prove Griesmer type bounds for additive codes over finite fields. These new bounds give upper bounds on the length of maximum distance separable (MDS) codes, codes which attain the Singleton bound. We will also consider…
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determined by the nonlinear codeword length objective of…
We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.