Related papers: Boundary effect of deterministic dense coding

This work provides the general framework for obtaining strong Szeg\H{o} limit theorems for multi-bordered, semi-framed, framed, and multi-framed Toeplitz determinants, extending the results of Basor et al. (2022) beyond the (single)…

We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error…

In recent experiments on nanoscale Al particles, whose electron number was fixed by charging effects, a ``negative gap'' was observed in particles with an odd number of electrons. This observation has called into question the use of a grand…

The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and…

Numerical studies of the domain chaos state in a model of rotating Rayleigh-Benard convection suggest that finite size effects may account for the discrepancy between experimentally measured values of the correlation length and the…

This work introduces a decoding strategy for binary self-dual codes possessing an automorphism of a specific type. The proposed algorithm is a hard decision iterative decoding scheme. The enclosed experiments show that the new decoding…

I investigate dense coding with a general mixed state on the Hilbert space $C^{d}\otimes C^{d}$ shared between a sender and receiver. The following result is proved. When the sender prepares the signal states by mutually orthogonal unitary…

Recent works have shown that tokenisation is NP-complete. However, these works assume tokenisation is applied to inputs with unboundedly large alphabets -- an unrealistic assumption, given that in practice tokenisers operate over fixed-size…

We show, by an explicit construction, that a mixture of univariate Gaussian densities with variance $1$ and means in $[-A,A]$ can have $\Omega(A^2)$ modes. This disproves a recent conjecture of Dytso, Yagli, Poor and Shamai \cite{DYPS20}…

Electronic properties of disordered binary alloys are studied via the calculation of the average Density of States (DOS) in two and three dimensions. We propose a new approximate scheme that allows for the inclusion of local order effects…

String theory in d dimensions has n+1=11-d parameters that may be thought of as being inherited from the geometry of an n+1 torus which may be used to construct the theory using dimensional reduction from eleven dimensions. We give the…

We derive a scale-free bound on the density of the maximum of a centered Gaussian vector. The basic bound is non-uniform, depends logarithmically on the dimension, and allows any covariance matrix. When the largest marginal variance is…

A classic result due to Douglas establishes that, for odd spread $k$ and dimension $d=\frac{1}{2}(3k+3)$, all maximum length $(d,k)$ circuit codes are isomorphic. Using a recent result of Byrnes we extend Douglas's theorem to prove that,…

This work continues the study of the properties of finitely constrained groups of binary tree automorphisms in terms of their Hausdorff dimension. We prove that there are exactly $2^{2d-3}$ finitely constrained groups of binary tree…

Let M_n denote the number of sites in the largest cluster in critical site percolation on the triangular lattice inside a box side length n. We give lower and upper bounds on the probability that M_n / E(M_n) > x of the form exp(- C…

Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.

A one-dimensional diagonal tight binding electronic system with correlated disorder is investigated. The correlation of the random potential is exponentially decaying with distance and its correlation length diverges as the concentration of…

Deterministic identification (DI) for the discrete-time Poisson channel, subject to an average and a peak power constraint, is considered. It is established that the code size scales as $2^{(n\log n)R}$, where $n$ and $R$ are the block…

For $X(n)$ a Steinhaus random multiplicative function, we study the maximal size of the random Dirichlet polynomial $$ D_N(t) = \frac1{\sqrt{N}} \sum_{n \leq N} X(n) n^{it}, $$ with $t$ in various ranges. In particular, for fixed $C>0$ and…

Let $A(n,d,w)$ be the largest possible size of an $(n,d,w)$ constant-weight binary code. By adding new constraints to Delsarte linear programming, we obtain twenty three new upper bounds on $A(n,d,w)$ for $n \leq 28$. The used techniques…