Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Favano, Antonino"'
This work considers a binomial noise channel. The paper can be roughly divided into two parts. The first part is concerned with the properties of the capacity-achieving distribution. In particular, for the binomial channel, it is not known if the cap
Externí odkaz:
http://arxiv.org/abs/2401.12818
This paper studies secrecy-capacity of an $n$-dimensional Gaussian wiretap channel under a peak-power constraint. This work determines the largest peak-power constraint $\bar{\mathsf{R}}_n$ such that an input distribution uniformly distributed on a s
Externí odkaz:
http://arxiv.org/abs/2208.03384
Upper bounds on the capacity of vector Gaussian channels affected by fading are derived under peak amplitude constraints at the input. The focus is on constraint regions that can be decomposed in a Cartesian product of sub-regions. This constraint mo
Externí odkaz:
http://arxiv.org/abs/2207.01266
This paper studies secrecy-capacity of an $n$-dimensional Gaussian wiretap channel under the peak-power constraint. This work determines the largest peak-power constraint $\bar{\mathsf{R}}_n$ such that an input distribution uniformly distributed on a
Externí odkaz:
http://arxiv.org/abs/2202.00586
An upper bound on the capacity of multiple-input multiple-output (MIMO) Gaussian fading channels is derived under peak amplitude constraints. The upper bound is obtained borrowing concepts from convex geometry and it extends to MIMO channels notable
Externí odkaz:
http://arxiv.org/abs/2111.13179
The capacity of multiple-input multiple-output additive white Gaussian noise channels is investigated under peak amplitude constraints on the norm of the input vector. New insights on the capacity-achieving input distribution are presented. Furthermo
Externí odkaz:
http://arxiv.org/abs/2101.08643
Autor:
Favano, Antonino1 (AUTHOR), Barletta, Luca1 (AUTHOR) luca.barletta@polimi.it, Dytso, Alex2 (AUTHOR)
Publikováno v:
Entropy. May2023, Vol. 25 Issue 5, p741. 35p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.