English
Related papers

Related papers: New asymptotic bounds for self-dual codes and latt…

200 papers

We develop a probabilistic framework for large-scale dimension bounds in metric geometry, based on padded decompositions, randomized ball carving on net graphs, and the Lov\'asz Local Lemma. For metric measure spaces with volume doubling…

Metric Geometry · Mathematics 2026-05-18 Jing Yu , Xingyu Zhu

All codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new exact…

Information Theory · Computer Science 2016-11-18 Iliya Bouyukliev , Erik Jakobsson

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…

Information Theory · Computer Science 2021-01-22 Binbin Pang , Shixin Zhu , Xiaoshan Kai

We prove that there exist non-linear binary cyclic codes that attain the Gilbert-Varshamov bound.

Information Theory · Computer Science 2017-01-05 Ishay Haviv , Michael Langberg , Moshe Schwartz , Eitan Yaakobi

Binary optimal codes often contain optimal or near-optimal subcodes. In this paper we show that this is true for the family of self-dual codes. One approach is to compute the optimum distance profiles (ODPs) of linear codes, which was…

Information Theory · Computer Science 2012-10-23 Finley Freibert , Jon-Lark Kim

Utilizing frameworks developed by Delsarte, Yudin and Levenshtein, we deduce linear programming lower bounds (as $N\to \infty$) for the Riesz energy of $N$-point configurations on the $d$-dimensional unit sphere in the so-called…

Mathematical Physics · Physics 2019-02-20 Douglas P. Hardin , Timothy J. Michaels , Edward B. Saff

We prove upper bounds on outside probabilities for generic non-autonomous Schr\"odinger operators on lattices of arbitrary dimension. Our approach is based on a combination of commutator method originated in scattering theory and novel…

Mathematical Physics · Physics 2024-10-01 Jingxuan Zhang

The Kuznetsov equation is a classical wave model of acoustics that incorporates quadratic gradient nonlinearities. When its strong damping vanishes, it undergoes a singular behavior change, switching from a parabolic-like to a hyperbolic…

Numerical Analysis · Mathematics 2025-10-01 Benjamin Dörich , Vanja Nikolić

We investigate the non-relativistic limit of the Cauchy problem for the defocusing cubic nonlinear Klein-Gordon equations whose initial velocity contains a factor of $c^2$, with $c$ being the light speed. While the classical WKB expansion…

Analysis of PDEs · Mathematics 2023-09-20 Zhen Lei , Yifei Wu

Tight bounds for several symmetric divergence measures are derived in terms of the total variation distance. It is shown that each of these bounds is attained by a pair of 2 or 3-element probability distributions. An application of these…

Information Theory · Computer Science 2016-11-17 Igal Sason

We prove a lower bound of $\Omega(n^2/\log^2 n)$ on the size of any syntactically multilinear arithmetic circuit computing some explicit multilinear polynomial $f(x_1, \ldots, x_n)$. Our approach expands and improves upon a result of Raz,…

Computational Complexity · Computer Science 2017-11-03 Noga Alon , Mrinal Kumar , Ben Lee Volk

Locally repairable codes which are optimal with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. The new bounds both improve and generalize previously known…

Information Theory · Computer Science 2019-04-10 Han Cai , Ying Miao , Moshe Schwartz , Xiaohu Tang

We identify universal polar dual pairs of spherical codes $C$ and $D$ such that for a large class of potential functions $h$ the minima of the discrete $h$-potential of $C$ on the sphere occur at the points of $D$ and vice versa. Moreover,…

Combinatorics · Mathematics 2026-01-01 S. V. Borodachov , P. G. Boyvalenkov , P. D. Dragnev , D. P. Hardin , E. B. Saff , M. M. Stoyanova

We consider the problem of constructing dense lattices of R^n with a given automorphism group. We exhibit a family of such lattices of density at least cn/2^n, which matches, up to a multiplicative constant, the best known density of a…

Number Theory · Mathematics 2007-07-08 Philippe Gaborit , Gilles Zemor

Bounds on linear codes play a central role in coding theory, as they capture the fundamental trade-off between error-correction capability (minimum distance) and information rate (dimension relative to length). Classical results…

Information Theory · Computer Science 2025-09-04 Liren Lin , Guanghui Zhang , Bocong Chen , Hongwei Liu

Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivially. Multinegacirculant codes of index $2$ that are LCD are characterized algebraically and some good codes are found in this family. Exact…

Information Theory · Computer Science 2017-03-10 Adel Alahmadi , Cem Güneri , Buket Özkaya , Hatoon Shoaib , Patrick Solé

There has been remarkable progress over the past decade in establishing finite-sample, non-asymptotic bounds on recovering unknown system parameters from observed system behavior. Surprisingly, however, we show that the current…

Machine Learning · Statistics 2026-04-24 Yichen Zhou , Stephen Tu

The most general supersymmetric model contains baryon number violating terms of the form $\lambda_{ijk}\;\ov{D}_i\, \ov{D}_j\, \ov{U}_k$ in the superpotential. We reconsider the bounds on these couplings, assuming that lepton number…

High Energy Physics - Phenomenology · Physics 2014-11-17 J. L. Goity , Marc Sher

Minkowski's First Theorem and Dirichlet's Approximation Theorem provide upper bounds on certain minima taken over lattice points contained in domains of Euclidean spaces. We study the distribution of such minima and show, under some…

Number Theory · Mathematics 2022-01-14 Michael Björklund , Alexander Gorodnik

We consider lossy compression of a binary symmetric source by means of a low-density generator-matrix code. We derive two lower bounds on the rate distortion function which are valid for any low-density generator-matrix code with a given…

Information Theory · Computer Science 2008-04-11 Shrinivas Kudekar , Ruediger Urbanke