Skip to content
Preprint

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

Oct 2026 · 0 citations · 17 references
Computer Science Mathematics

TL;DR

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.

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.

View source

Similar papers

Preprint Oct 2026

Feasibility of Common-Stream-Only Sensing in ZF-RSMA with Imperfect CSIT

Reusing the Rate-Splitting Multiple Access (RSMA) common stream for sensing eliminates dedicated probing signals in Integrated Sensing and Communication (ISAC), but creates a feasibility bottleneck: the common-power fraction must simultaneously support common decoding, private decoding, and target detection. This paper...

Surya Harsha, Shankar Prakriya · 0 citations
Preprint Nov 2026

Inverse Design of Finite-State Channels by Dynamic Measure Matching

Inspired by the optimization approach to biology, we formulate an inverse problem for communication with memory: construct a finite-state channel for which a given signaling behavior supports capacity-achieving codes. Dynamic measure matching is introduced to turn a directed-information converse into conditions on the...

L. Varshney · 0 citations
Sep 2026

Adaptive Coding for Two-Way Wiretap Channels with One-Sided Strong Secrecy

A multiround leakage theorem is proved that accounts both for information revealed about a key before its later use and for the possibility that an encoder uses an incorrectly decoded key.

Masahito Hayashi, Yan-Ling Chen · 0 citations
Preprint Sep 2026

Interference-Free Capacity of a Binary Interference Channel with Causal Observation

We determine the capacity region of a two-user binary interference channel with receiver-controlled observation and prove that causal port selection attains the interference-free limit. The physical--observation dual-axis formulation makes the observation kernel a design variable subject to explicit causal and resource...

Xian-Wei Meng · 0 citations
Preprint Nov 2026

Quantum Communication and Phase Sensing over a Dephasing Channel with Thermal Noise

Dephasing is a prominent source of decoherence in quantum communication, degrading phase coherence and transmission reliability. Therefore, knowledge of the physical channel parameters for reliable transmission is imperative, motivating the integration of quantum communication and sensing at the physical layer. Consequ...

Nikos A. Mitsiou, I. Krikidis · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.