TY - GEN

T1 - Identification over the Gaussian Channel in the Presence of Feedback

AU - Labidi, Wafa

AU - Boche, Holger

AU - Deppe, Christian

AU - Wiese, Moritz

N1 - Publisher Copyright:
© 2021 IEEE.

PY - 2021/7/12

Y1 - 2021/7/12

N2 - We analyze message identification via Gaussian channels with noiseless feedback, which is part of the 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. If the noise variance is positive, we propose a coding scheme that generates infinite common randomness between the sender and the receiver. We show that any identification rate via the Gaussian channel with noiseless feedback can be achieved. The remarkable result is that this applies to both rate definitions \frac{1}{n}\log M (as defined by Shannon for transmission) and \frac{1}{n}\ \log \log\ M - (as defined by Ahlswede and Dueck for identification). We can even show that our result holds regardless of the selected scaling for the rate. A detailed version with all proofs, explanations and more discussions can be found in [1].

AB - We analyze message identification via Gaussian channels with noiseless feedback, which is part of the 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. If the noise variance is positive, we propose a coding scheme that generates infinite common randomness between the sender and the receiver. We show that any identification rate via the Gaussian channel with noiseless feedback can be achieved. The remarkable result is that this applies to both rate definitions \frac{1}{n}\log M (as defined by Shannon for transmission) and \frac{1}{n}\ \log \log\ M - (as defined by Ahlswede and Dueck for identification). We can even show that our result holds regardless of the selected scaling for the rate. A detailed version with all proofs, explanations and more discussions can be found in [1].

UR - http://www.scopus.com/inward/record.url?scp=85110933064&partnerID=8YFLogxK

U2 - 10.1109/ISIT45174.2021.9517727

DO - 10.1109/ISIT45174.2021.9517727

M3 - Conference contribution

AN - SCOPUS:85110933064

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 278

EP - 283

BT - 2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2021 IEEE International Symposium on Information Theory, ISIT 2021

Y2 - 12 July 2021 through 20 July 2021

ER -