Identification via the broadcast channel

We show that the identification (ID) capacity of the two-receivers broadcast channel is the set of rate pairs satisfying that, for some distribution on the input, each receiver's ID rate does not exceed the mutual information between the input and the output that it observes. The capacity's interior is achieved by codes with deterministic encoders. Our results hold under the average error criterion, which requires that each receiver reliably identify its message if the other receiver's message is uniformly distributed. Key in the proof is a new ID code for the single-user channel.

[1]  Rudolf Ahlswede,et al.  New directions in the theory of identification via channels , 1995, IEEE Trans. Inf. Theory.

[2]  Claude E. Shannon,et al.  The mathematical theory of communication , 1950 .

[3]  Rudolf Ahlswede,et al.  Identification via channels , 1989, IEEE Trans. Inf. Theory.

[4]  Sergio Verdú,et al.  New results in the theory of identification via channels , 1992, IEEE Trans. Inf. Theory.

[5]  Rudolf Ahlswede,et al.  Identification in the presence of feedback-A discovery of new capacity formulas , 1989, IEEE Trans. Inf. Theory.

[6]  Annina Bracher,et al.  Identification and zero-error codes , 2016 .

[7]  Yasutada Oohama.  Converse coding theorem for identification via general degraded broadcast channels , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[8]  F. Willems.  The maximal-error and average-error capacity region of the broadcast channel are identical : A direct proof , 1990 .

[9]  Rocco A. Servedio,et al.  Testing probability distributions using conditional samples , 2012, Electron. Colloquium Comput. Complex..

[10]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[11]  Rudolf Ahlswede,et al.  On identification via multiway channels with feedback , 1991, IEEE Trans. Inf. Theory.

[12]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[13]  Sergio Verdú,et al.  Approximation theory of output statistics , 1993, IEEE Trans. Inf. Theory.

[14]  Venkat Anantharam,et al.  Identification Plus Transmission Over Channels with Perfect Feedbac , 1998, IEEE Trans. Inf. Theory.

[15]  Erol A. Peköz,et al.  A Second Course in Probability , 2007 .

[16]  Edward C. van der Meulen,et al.  Capacity bounds for identification via broadcast channels which are optimal for the deterministic broadcast channel , 1990, IEEE Trans. Inf. Theory.

[17]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[18]  Rudolf Ahlswede,et al.  General theory of information transfer: Updated , 2008, Discret. Appl. Math..

[19]  Yossef Steinberg,et al.  Inner and outer bounds on the identification capacity region of the degraded broadcast channel , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[20]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[21]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[22]  L. Goddard.  Information Theory , 1962, Nature.