Capacity of Finite State Channels With Feedback: Algorithmic and Optimization Theoretic Properties-Reference-Cited by-同舟云学术

Capacity of Finite State Channels With Feedback: Algorithmic and Optimization Theoretic Properties

Published:2024-08 Issue:8 Volume:70 Page:5413-5426
ISSN:0018-9448
Container-title:IEEE Transactions on Information Theory
language:
Short-container-title:IEEE Trans. Inform. Theory

Author:

Grigorescu Andrea¹^ORCID,Boche Holger²^ORCID,Schaefer Rafael F.³^ORCID,Vincent Poor H.⁴^ORCID

Affiliation:

1. Technical University of Munich, Munich, Germany

2. Excellence Cluster Cyber Security in the Age of Large-Scale Adversaries (CASA), Ruhr University, Bochum, Germany

3. Chair of Information Theory and Machine Learning, the BMBF Research Hub 6G-life, the Cluster of Excellence “Centre for Tactile Internet with Human-in-the-Loop” (CeTI), and the 5G Lab Germany, Technische Universität Dresden, Dresden, Germany

4. Department of Electrical and Computer Engineering, Princeton University, Princeton, NJ, USA

Funder

BMBF Quantum Program Quanten Drahtloses Campusnetzwerk (QD-CamNetz) and Quantum Physical Layer Service Intergration

German Federal Ministry of Education and Research (BMBF) within the National Initiative on 6G Communication Systems Through the Research Hub 6G-life

National Initiative on Post Shannon Communication

German Research Foundation (DFG) within the Priority Program Resilient Worlds

BMBF Quantum Program Quantenkommunikation für Internet-of- Things-Netzwerke (QUIET) and Quantenrepeater.Link

DFG as part of Germany’s Excellence Strategy–EXC 2050/1–Cluster of Excellence “Centre for Tactile Internet with Human-in-the-Loop” (CeTI) of Technische Universität Dresden

National Science Foundation

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Link

https://ieeexplore.ieee.org/ielam/18/10599340/10552307-aam.pdf

Reference46 articles.

1. Capacity of Finite State Channels with Feedback: Algorithmic and Optimization Theoretic Properties

2. On 6G and trustworthiness

3. Lower bounds to error probability for coding on discrete memoryless channels. I

4. An algorithm for computing the capacity of arbitrary discrete memoryless channels

5. Computation of channel capacity and rate-distortion functions