Fig 1 - uploaded by Uzi Pereg
Content may be subject to copyright.
Deterministic identification for the Gaussian channel with fast fading, where G is a sequence of i.i.d. fading coefficients ∼ f G , and the noise sequence Z is i.i.d. ∼ N (0, σ 2 Z ).
Source publication
Deterministic identification (DI) is addressed for Gaussian channels with fast and slow fading, where channel side information is available at the decoder. In particular, it is established that the number of messages scales as $2^{n log(n)R} $, where n is the block length and R is the coding rate. Lower and upper bounds on the DI capacity are devel...
Contexts in source publication
Similar publications
We consider Gaussian graphical models associated with an equicorrelational and one-dimensional conditional independence graph. We show that pairwise correlation decays exponentially as a function of distance. We also provide a limit when the number of variables tend to infinity and quantify the difference between the finite and infinite cases.
We introduce the exponentially preferential recursive tree and study some properties related to the degree profile of nodes in the tree. The definition of the tree involves a radix $a\gt 0$ . In a tree of size $n$ (nodes), the nodes are labeled with the numbers $1,2, \ldots ,n$ . The node labeled $i$ attracts the future entrant $n+1$ with probabili...
The kernel exponential family is a rich class of distributions, which can be fit efficiently and with statistical guarantees by score matching. Being required to choose a priori a simple kernel such as the Gaussian, however, limits its practical applicability. We provide a scheme for learning a kernel parameterized by a deep network, which can find...
Percentiles and more generally, quantiles are commonly used in various contexts to summarize data. For most distributions, there is exactly one quantile that is unbiased. For distributions like the Gaussian that have the same mean and median, that becomes the medians. There are different ways to estimate quantiles from finite samples described in t...
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 length and coding rate, respectively. The authors have recently shown a similar property for Gaussian channels [1]...
