Related papers: Boundary effect of deterministic dense coding
In this paper we study the question of whether on smooth projective surfaces the denominators in the volumes of big line bundles are bounded. In particular we investigate how this condition is related to bounded negativity (i.e., the…
Four problems related to information divergence measures defined on finite alphabets are considered. In three of the cases we consider, we illustrate a contrast which arises between the binary-alphabet and larger-alphabet settings. This is…
The problem of variable length and fixed-distortion universal source coding (or D-semifaithful source coding) for stationary and memoryless sources on countably infinite alphabets ($\infty$-alphabets) is addressed in this paper. The main…
Non-overlapping codes have been studied for almost 60 years. In such a code, no proper, non-empty prefix of any codeword is a suffix of any codeword. In this paper, we study codes in which overlaps of certain specified sizes are forbidden.…
Important insights towards the explainability of neural networks reside in the characteristics of their decision boundaries. In this work, we borrow tools from the field of adversarial robustness, and propose a new perspective that relates…
Boundary modes localized on the boundaries of a finite-size lattice experience a finite size effect (FSE) that could result in unwanted couplings, crosstalks and formation of gaps even in topological boundary modes. It is commonly believed…
Consider a $q$-ary block code satisfying the property that no $l$-letters long codeword's prefix occurs as a suffix of any codeword for $l$ inside some interval. We determine a general upper bound on the maximum size of these codes and a…
Finite size effects in the localization properties of disordered quantum wires are analyzed through conductance calculations. Disorder is induced by introducing vacancies at random positions in the wire and thus preserving the chiral…
The efficacy of a specially constructed Gallager-type error-correcting code to communication in a Gaussian channel is being examined. The construction is based on the introduction of complex matrices, used in both encoding and decoding,…
We analyze a contribution of the finite-width (mass-smearing) effects to the mixing of neutral mesons. It was shown, that this contribution is dominant in the D-meson system and large in the K-meson one. An account of the mass-smearing…
Polynomial, or Delsarte's, method in coding theory accounts for a variety of structural results on, and bounds on the size of, extremal configurations (codes and designs) in various metric spaces. In recent works of the authors the…
An erasure channel with a fixed alphabet size $q$, where $q \gg 1$, is studied. It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes achieve the minimum probability of error (assuming…
We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes our method exploits…
We show that iterative coding systems can not surpass capacity using only quantities which naturally appear in density evolution. Although the result in itself is trivial, the method which we apply shows that in order to achieve capacity…
The spherical limit of strongly commensurate dirty-bosons is studied perturbatively at weak disorder and numerically at strong disorder in two dimensions (2D). We argue that disorder is not perfectly screened by interactions, and…
This thesis is a study of large sets of unit vectors in $\cx^n$ such that the absolute value of their standard inner products takes on only a small number of values. We begin with bounds: what is the maximal size of a set of lines with only…
We tabulate bounds on the optimal number of mutually unbiased bases in R^d. For most dimensions d, it can be shown with relatively simple methods that either there are no real orthonormal bases that are mutually unbiased or the optimal…
The collective interference of partially distinguishable bosons in multi-mode networks is studied via double-sided Feynman diagrams. The probability for many-body scattering events becomes a multi-dimensional tensor-permanent, which…
We derive theoretical upper and lower bounds on the maximum size of DNA codes of length n with constant GC-content w and minimum Hamming distance d, both with and without the additional constraint that the minimum Hamming distance between…
Extending recent numerical studies on two dimensional amorphous bodies, we characterize the approach of elastic continuum limit in three dimensional (weakly polydisperse) Lennard-Jones systems. While performing a systematic finite-size…