Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 51 min ago
PreprintarXiv licencearXiv

Joint Identification, Transmission, and Sensing over State-Dependent Channels with Noiseless Feedback

Abstract

We consider a discrete memoryless state-dependent channel with noiseless feedback, where the transmitter uses randomized encoding to jointly perform message transmission, identification, and state sensing. In this setting, the transmitter sends a conventional transmission message and an identification message while estimating the unknown channel state sequence under an average distortion constraint. We establish a single-letter characterization of the randomized identification-transmission-sensing capacity-distortion region. The result reveals a single-letter separation structure: the communication rates are determined by the averaged channel, subject to the sensing-induced constraint on admissible input distributions. Specifically, the transmission rate is characterized by mutual information, while the identification rate is characterized by output entropy under the same distortion constraint. The achievability proof combines constant-composition transmission coding, output partitioning, and combinatorial identification coding, while the converse follows from an averaged-channel reduction, distortion lower bounds, and feedback-identification converse arguments.

Related

  1. Secure Deterministic Identification with Feedback and Sensing over State-Dependent Wiretap Channels
    Vida Gholamian, Yaning Zhao, Christian Deppe +2
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  2. No information transmission through quantum channels above capacity
    Hao-Chung Cheng, Marco Tomamichel
    arXivPreprintarXiv licenceFull textMathematical physicsQuantum physics & quantum informationarXiv
  3. Nonlinear Posterior-Mean Feedback Codes for AWGN Channels
    Yingyao Zhou, Natasha Devroye, Milos Zefran +1
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  4. Feedback Capacity of Stationary Gaussian Channels: An Optimal Schalkwijk-Kailath Scheme
    David Fay, Oron Sabag
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  5. KKTCode: Asymptotically Optimal Linear Codes for Noisy Feedback AWGN Channels
    Hongjae Nam, Jonggyu Jang, Vishrant Tripathi +1
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
BibTeX
@misc{gholamian2026joint,
  title = {{Joint Identification, Transmission, and Sensing over State-Dependent Channels with Noiseless Feedback}},
  author = {Vida Gholamian and Marcel A. Mross and Roberto Ferrara and Eduard A. Jorswieck and Christian Deppe},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.19784},
  eprint = {2610.19784},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.19784},
}
RIS
TY  - UNPB
TI  - Joint Identification, Transmission, and Sensing over State-Dependent Channels with Noiseless Feedback
AU  - Vida Gholamian
AU  - Marcel A. Mross
AU  - Roberto Ferrara
AU  - Eduard A. Jorswieck
AU  - Christian Deppe
PY  - 2026
DA  - 2026/10/14
PB  - arXiv
DO  - 10.48550/arxiv.2610.19784
UR  - https://arxiv.org/abs/2610.19784
AB  - We consider a discrete memoryless state-dependent channel with noiseless feedback, where the transmitter uses randomized encoding to jointly perform message transmission, identification, and state sensing. In this setting, the transmitter sends a conventional transmission message and an identification message while estimating the unknown channel state sequence under an average distortion constraint. We establish a single-letter characterization of the randomized identification-transmission-sensing capacity-distortion region. The result reveals a single-letter separation structure: the communication rates are determined by the averaged channel, subject to the sensing-induced constraint on admissible input distributions. Specifically, the transmission rate is characterized by mutual information, while the identification rate is characterized by output entropy under the same distortion constraint. The achievability proof combines constant-composition transmission coding, output partitioning, and combinatorial identification coding, while the converse follows from an averaged-channel reduction, distortion lower bounds, and feedback-identification converse arguments.
ER  -