Information and control: Matching channels

IEEE Transactions on Information Theory

Volumn 44, Issue 2, 1998, Pages 542-563

  Ahlswede, Rudolf ^a   Cai, Ning ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

Combinatorial matching; Detection; Feedback; Identification; New channel models; Zero error problems

Indexed keywords

DATA COMMUNICATION SYSTEMS; DECODING; ENCODING (SYMBOLS); MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; SPURIOUS SIGNAL NOISE;

COMBINATORIAL MATCHING THEORY; DETERMINISTIC MATCHING CHANNEL; ZERO ERROR PROBLEMS;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 0032022517     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.661504     Document Type: Article

References (30)

1. R. Ahlswede, "On set coverings in Cartesian product spaces," Preprint 92-005, SFB 343 "Diskrete Strukturen in der Mathematik," Universität Bielefeld, Bielefeld, Germay.
2. R. Ahlswede and N. Cai, "Cross disjoint pairs of clouds in the interval lattice," in "Diskrete Sturkturen in der Mathematik," Universität Bielefeld, Bielefeld, Germany, Preprint 93-038, SFB 343.
3. R. L. Graham and J. Nešetřil, Eds., The Mathematics of Paul Erdös, Algorithm and Combinatorics 13. Berlin, Heidelnerg, Germany: Springer, 1997, pp. 155-164.
4. I. Anderson, Combinatorics of Finite Sets. Oxford, U.K.: Claredon, 1987.
5. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
6. A. Blokhuis, "On the Sperner capacity of the cyclic triangle," J. Algeb. Combin., vol. 2, pp. 123-124, 1993.
7. P. Hall, "On representatives of subsets," J. London Math. Soc., vol. 10, pp. 26-30, 1935.
8. L. Lovasz and M. D. Plummer, Matching Theory. Amsterdam, The Netherlands: North-Holland, 1986.
9. C. E. Shannon, "The zero-error capacity of a noisy channel," IRE Trans. Inform. Theory, vol. IT-2, pp. 8-19, 1956.
10. R. Ahlswede, N. Cai, and Z. Zhang, "Erasure, list, and detection zero-error capacities for low noise and a relation to identification," IEEE Trans. Inform. Theory, vol. 42, pp. 55-62, Jan. 1996.
11. D. König, "Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre," Math. Annalen, vol. 77, pp. 453-465, 1916.
12. L. Gargano, J. Körner, and U. Vaccaro, "Sperner capacities," Graphs and Combinatorics, to be published.
13. R. Ahlswede and G. Dueck, "Identification via channels," IEEE Trans. Inform. Theory, vol. 35, pp. 15-29, Jan. 1989.
14. _, "Identification in the presence of feedback - A discovery of new capacity formulas," IEEE Trans. Inform. Theory, vol. 35, pp. 30-39, Jan. 1989.
15. R. Ahlswede and N. Cai, "On extremal set partitions in Cartesian product spaces," Comb., Probab. Comput., vol. 2, pp. 211-220, 1993.
16. R. Ahlswede, "Channels with arbitrary varying channel probability functions in the presence of feedback," Z. Wahrscheinlichkeitstheorie und verw. Geb., vol. 25, pp. 239-252, 1973.
17. R. Ahlswede and G. Dueck, "Good codes can be produced by a few permutations," IEEE Trans. Inform. Theory, vol. IT-28, pp. 430-443, May 1982.
18. R. Ahlswede, "Coloring hypergraphs: A new approach to multi-user source coding," Part I, J. Comb., Inform., Syst. Sci., vol. 4, pp. 76-115, 1979;
19. R. Ahlswede, "Coloring hypergraphs: A new approach to multi-user source coding," Part I, J. Comb., Inform., Syst. Sci., Part II, vol. 5, pp. 220-268, 1980.
20. R. Ahlswede and G. Simonyi, "Reusable memories in the light of the old varying and a new outputwise varying channel theory," IEEE Trans. Inform. Theory, vol. 37, pp. 1143-1150, July 1991.
21. M. S. Pinsker, "Capacity region of noiseless broadcast channels" (in Russian), Probl. Pered. Inform., vol. 14, no. 2, pp. 28-32, 1978.
22. T. M. Cover, "Broadcast channels," IEEE Trans. Inform. Theory, vol. IT-18, pp. 2-14, Jan. 1972.
23. E. C. van der Meulen, "Random coding theorems for the general discrete memoryless broadcast channel," IEEE Trans. Inform. Theory, vol. IT-21, pp. 180-190, 1975.
24. R. Ahlswede and A. Kaspi, "Optimal coding strategies for certain permuting channels," IEEE Trans. Inform. Theory, vol. IT-33, pp. 310-314, May 1987.
25. R. Ahlswede, J. Ye, and Z. Zhang, "Creating order in sequence spaces with simple machines," Inform. Comput., vol. 89, no. 1, pp. 47-94, 1990.
26. K. Kobayashi, "Combinatorial structure and capacity of the permuting relay channel," IEEE Trans. Inform. Theory, vol. IT-33, pp. 813-826, Nov. 1987.
27. R. Ahlswede, "Certain results in coding theory for compound channels," in Proc. Coll. on Information Thheory (Debrecen, Hungary), 1967, pp. 35-60.
28. R. Ahlswede and Z. Zhang, "Coding for write efficient memories," Inform. Comput., vol. 83, no. 1, pp. 80-97, 1989.
29. R. Ahlswede, "A method of coding and an application to arbitrarily varying channels," J. Comb., Inform. Syst. Sci., vol. 5, no. 1, pp. 10-35, 1980.
30. _, "Information and control: Matching channels," Preprint 95-035, SFB 343 "Diskrete Strukturen in der Mathematik, Universität Bielefeld, Bielefeld, Germany.