Related papers: A note on the capacity of the binary perceptron
We study the discrete memoryless Z-interference channel (ZIC) where the transmitter of the pair that suffers from interference is cognitive. We first provide an upper bound on the capacity of this channel. We then show that, when the…
The input-constrained binary erasure channel (BEC) with strictly causal feedback is studied. The channel input sequence must satisfy the $(0,k)$-runlength limited (RLL) constraint, i.e., no more than $k$ consecutive `$0$'s are allowed. The…
Let $C(d)$ be the capacity of the binary deletion channel with deletion probability $d$. It was proved by Drinea and Mitzenmacher that, for all $d$, $C(d)/(1-d)\geq 0.1185 $. Fertonani and Duman recently showed that $\limsup_{d\to…
We present novel bounds on the capacity of the independent and identically distributed binary deletion channel. Four upper bounds are obtained by providing the transmitter and the receiver with genie-aided information on suitably-defined…
We develop a least-squares method for computing the analytic capacity of compact plane sets with piecewise-analytic boundary. The method furnishes rigorous upper and lower bounds which converge to the true value of the capacity. Several…
Almost four decades ago, Bergman and Milton independently showed that the isotropic effective electric permittivity of a two-phase composite material with a given volume fraction is constrained to lie within lens-shaped regions in the…
We analyze the quantum capacity of a unital quantum channel, using ideas from the proof of near-optimality of Petz recovery map [Barnum and Knill 2000] and give an upper bound on the quantum capacity in terms of regularized output $2$-norm…
This paper establishes new bounds on the maximum number of electrons $ N_c(Z) $ that an atom with nuclear charge $Z$ can bind. Specifically, we show that \begin{equation*} N_c(Z) < 1.1185Z + O(Z^{1/3}) \end{equation*} with an explicit bound…
New bounds on the semantic secrecy capacity of the binary adversarial wiretap channel are established . Against an adversary which reads a $\rho_r$ fraction of the transmitted codeword and modifies a $\rho_w$ fraction of the codeword, we…
We present a brief survey of existing mistake bounds and introduce novel bounds for the Perceptron or the kernel Perceptron algorithm. Our novel bounds generalize beyond standard margin-loss type bounds, allow for any convex and Lipschitz…
The paper considers the input-constrained binary erasure channel (BEC) with causal, noiseless feedback. The channel input sequence respects the $(d,\infty)$-runlength limited (RLL) constraint, i.e., any pair of successive $1$s must be…
Fractal percolation has been introduced by Mandelbrot in 1974. We study the two-dimensional case, with integer subdivision index M and survival probability p. It is well known that there exists a non-trivial critical value p_c(M) such that…
Consider critical site percolation on $\mathbb{Z}^d$ with $d \geq 2$. Cerf (2015) pointed out that from classical work by Aizenman, Kesten and Newman (1987) and Gandolfi, Grimmett and Russo (1988) one can obtain that the two-arms exponent…
The capacity of a channel with an energy-harvesting (EH) encoder and a finite battery remains an open problem, even in the noiseless case. A key instance of this scenario is the binary EH channel (BEHC), where the encoder has a unit-sized…
We revisit a subexponential bound for the $abc$ conjecture due to the first author, and we establish a variation of it using linear forms in logarithms. As an application, we prove an unconditional subexponential bound towards the $4$-terms…
K. Borsuk in 1979, in the Topological Conference in Moscow, introduced the concept of the capacity of a compactum. In this paper, we compute the capacity of the product of two spheres of the same or different dimensions and the capacity of…
We consider the symmetric binary perceptron model, a simple model of neural networks that has gathered significant attention in the statistical physics, information theory and probability theory communities, with recent connections made to…
Current and future B-mode polarization data are the most powerful observables to constrain gravitational waves from the early Universe. We set conservative constraints on tensor modes when relaxing the inflationary consistency condition…
The logarithmic capacity (also called Chebyshev constant or transfinite diameter) of two real intervals $[-1,\alpha]\cup[\beta,1]$ has been given explicitly with the help of Jacobi's elliptic and theta functions already by Achieser in 1930.…
Binary-input memoryless channels with a runlength constrained input are considered. Upper bounds to the capacity of such noisy runlength constrained channels are derived using the dual capacity method with Markov test distributions…