TY - GEN
T1 - Identification over Channels with Feedback
T2 - 2018 IEEE International Symposium on Information Theory, ISIT 2018
AU - Boche, Holger
AU - Schaefer, Rafael F.
AU - Poor, H. Vincent
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/8/15
Y1 - 2018/8/15
N2 - The problem of identification is considered, in which it is of interest for the receiver to decide only whether a certain message has been sent or not, and the identification-feedback (IDF) capacity of channels with feedback is studied. The IDF capacity is shown to be discontinuous and super-additive for both deterministic and randomized encoding. For the deterministic IDF capacity the phenomenon of super-activation occurs, which is the strongest form of super-additivity. For the randomized IDF capacity, super-activation is not possible. These findings imply that the IDF capacity is not Turing computable.
AB - The problem of identification is considered, in which it is of interest for the receiver to decide only whether a certain message has been sent or not, and the identification-feedback (IDF) capacity of channels with feedback is studied. The IDF capacity is shown to be discontinuous and super-additive for both deterministic and randomized encoding. For the deterministic IDF capacity the phenomenon of super-activation occurs, which is the strongest form of super-additivity. For the randomized IDF capacity, super-activation is not possible. These findings imply that the IDF capacity is not Turing computable.
UR - http://www.scopus.com/inward/record.url?scp=85052452222&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2018.8437891
DO - 10.1109/ISIT.2018.8437891
M3 - Conference contribution
AN - SCOPUS:85052452222
SN - 9781538647806
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 256
EP - 260
BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 17 June 2018 through 22 June 2018
ER -