Dependence Balance and Capacity Bounds for Multiterminal Communication and Wiretap Channels
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908955124432896 |
|---|---|
| author | Gohari, Amin Kramer, Gerhard |
| author_facet | Gohari, Amin Kramer, Gerhard |
| contents | An information measure based on fractional partitions of a set is used to derive a general dependence balance inequality for communication. This inequality is used to obtain new upper bounds on reliable and secret rates for multiterminal channels. For example, we obtain a new upper bound on the rate of shared randomness generated among terminals, a counterpart of the cut-set bound for reliable communication. The bounds for reliable communication use the concept of auxiliary receivers, and we show that they are optimized by Gaussian distributions for Gaussian channels. The bounds are applied to multiaccess channels with generalized feedback and relay channels, and improve the cut-set bound for scalar Gaussian channels. The improvement for Gaussian relay channels complements results obtained with other methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2009_14814 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Dependence Balance and Capacity Bounds for Multiterminal Communication and Wiretap Channels Gohari, Amin Kramer, Gerhard Information Theory An information measure based on fractional partitions of a set is used to derive a general dependence balance inequality for communication. This inequality is used to obtain new upper bounds on reliable and secret rates for multiterminal channels. For example, we obtain a new upper bound on the rate of shared randomness generated among terminals, a counterpart of the cut-set bound for reliable communication. The bounds for reliable communication use the concept of auxiliary receivers, and we show that they are optimized by Gaussian distributions for Gaussian channels. The bounds are applied to multiaccess channels with generalized feedback and relay channels, and improve the cut-set bound for scalar Gaussian channels. The improvement for Gaussian relay channels complements results obtained with other methods. |
| title | Dependence Balance and Capacity Bounds for Multiterminal Communication and Wiretap Channels |
| topic | Information Theory |
| url | https://arxiv.org/abs/2009.14814 |