Journal
IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 69, Issue 11, Pages 6811-6821Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2022.3152613
Keywords
Identification theory; feedback; common randomness; additive noise channels
Ask authors/readers for more resources
This article analyzes the deterministic message identification in channels with non-discrete additive white noise and with a noiseless feedback link. The research proposes a coding scheme that utilizes infinite common randomness and feedback to construct arbitrarily large deterministic identification codes.
We analyze deterministic message identification via channels with non-discrete additive white noise and with a noiseless feedback link under both average power and peak power constraints. The identification task is part of Post Shannon Theory. The consideration of communication systems beyond Shannon's approach is useful in order to increase the efficiency of information transmission for certain applications. We propose a coding scheme that first generates infinite common randomness between the sender and the receiver. If the channel has a positive message transmission feedback capacity, for given error thresholds and sufficiently large blocklength this common randomness is then used to construct arbitrarily large deterministic identification codes. In particular, the deterministic identification feedback capacity is infinite regardless of the scaling (exponential, doubly exponential, etc.) chosen for the capacity definition. Clearly, if randomized encoding is allowed in addition to the use of feedback, these results continue to hold.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available