Identification via Channels

IEEE Transactions on Information Theory

Volumn 35, Issue 1, 1989, Pages 15-29

  Ahlswede, Rudolf ^a   Dueck, Gunter ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33747102990     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.42172     Document Type: Article

References (6)

1. R. Ahlswede and G. Dueck, “Good codes can be produced by a few permutations,” IEEE Trans. Inform. Theory, vol. IT-28, no. 3, pp. 430-443, 1982.
2. R. Ahlswede, “Coloring hypergraphs: A new approach to multi-user source coding,” J. Comb. Inf. Syst. Sci., Pt. I, vol. 1, pp. 76-115, 1979; Pt. II, vol. 5, pp. 220-268, 1980.
3. R. Ahlswede, “A method of coding and an application to arbitrarily varying channels,” J. Comb. Inf. Syst. Sci., vol. 5, no. 1, pp. 10-35, 1980.
4. A. C. Yao, “Some complexity questions related to distributive computing,” in Proc. 11th Annu. Symp. Theory of Computing, Atlanta, GA, 1979, pp. 209-213.
5. J. Ja'Ja', “Identification is easier than decoding,” preprint, 1985.
6. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.