Related papers: Uniqueness of the (22,891,1/4) spherical code
This paper is devoted to the proof of boundedness of bilinear smooth square functions. Moreover, we deduce boundedness of some bilinear pseudo-differential operators associated with symbols belonging to a subclass of $BS^0_{0,0}$.
For a code $C$ in a space with maximal distance $n$, we say that $C$ has symmetric distances if its distance set $S(C)$ is symmetric with respect to $n / 2$. In this paper, we prove that if $C$ is a binary code with length $2n$, constant…
A new lower bound on the error probability of maximum likelihood decoding of a binary code on a binary symmetric channel was proved in Barg and McGregor (2004, cs.IT/0407011). It was observed in that paper that this bound leads to a new…
We compare two naturally arising notions of unknotting number for 2-spheres in the 4-sphere: namely, the minimal number of 1-handle stabilizations needed to obtain an unknotted surface, and the minimal number of Whitney moves required in a…
We present an extension of the Delsarte linear programming method. For several dimensions it yields improved upper bounds for kissing numbers and for spherical codes. Musin's recent work on kissing numbers in dimensions three and four can…
The question of which triangular numbers have a decimal representation containing a single repeated digit seamed to be settled since at least the 1970s: Ballew and Weger provided a complete list and a proof that these are the only numbers…
A cycle system of order $n$ is a decomposition of the edges of the complete graph $K_n$ into cycles of a fixed length. A cycle system is said to be $k$-colourable if we can assign $k$ colours to its vertices so that no cycle is…
We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…
We give a new upper bound of the cardinality of a set of equiangular lines in $\R^n$ with a fixed angle $\theta$ for each $(n,\theta)$ satisfying certain conditions. Our techniques are based on semi-definite programming methods for…
The field of quantum computation currently lacks a formal proof of experimental feasibility. Qubits are fragile and sophisticated quantum error correction is required to achieve reliable quantum computation. The surface code is a promising…
We list combinatorial criteria of some singularities, which appear in the Minimal Model Program or in the study of (singular) Fano varieties, for spherical varieties. Most of the results of this paper are already known or are quite easy…
Inspired by a recent preprint of N. Curien, we provided what may be a new and elementary proof of the Law of Large Numbers.
Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and…
We study side-channel attacks for the Shannon cipher system. To pose side channel-attacks to the Shannon cipher system, we regard them as a signal estimation via encoded data from two distributed sensors. This can be formulated as the one…
We show that there is a one-round randomized distributed algorithm that can 2-color cycles such that the expected fraction of monochromatic edges is less than 0.24118. We also show that a one-round algorithm cannot achieve a fraction less…
Given a quaternionic slice regular function $f$, we give a direct and effective way to compute the coefficients of its spherical expansion at any point. Such coefficients are obtained in terms of spherical and slice derivatives of the…
The maximum possible number of non-overlapping unit spheres that can touch a unit sphere in $n$ dimensions is called kissing number. The problem for finding kissing numbers is closely connected to the more general problems of finding bounds…
An outstanding folklore conjecture asserts that, for any prime $p$, up to isomorphism the projective plane $PG(2,\mathbb{F}_p)$ over the field $\mathbb{F}_p := \mathbb{Z}/p\mathbb{Z}$ is the unique projective plane of order $p$. Let $\pi$…
We consider weighted Reed-Muller codes over point ensemble $S_1 \times...\times S_m$ where $S_i$ needs not be of the same size as $S_j$. For $m = 2$ we determine optimal weights and analyze in detail what is the impact of the ratio…
By practicing the philosophy of our beloved late master, Marco Schutzenberger, to whose memory this article is dedicated, we give an insightful bijective proof of the three-term recurrence satisfied by the Hipparchus-Schroeder numbers…