1. Ahlswede, R.
    Certain results in coding theory for compound channels. I.
    Proc. Colloquium on Information Theory (Debrecen, 1967), Vol. I, pp. 35-60, János Bolyai Math. Soc., Budapest, 1968.

  2. Ahlswede, Rudolf
    Beiträge zur Shannonschen Informationstheorie im Falle nichtstationärer Kanäle. (German)
    Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 10, 1-42 (1968).

  3. Ahlswede, R.
    The weak capacity of averaged channels.
    Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 11, 61-73 (1968).

  4. Ahlswede, R.; Wolfowitz, J.
    Correlated decoding for channels with arbitrarily varying channel probability functions.
    Information and Control 14, 457-473 (1969).

  5. Ahlswede, R.; Wolfowitz, J.
    The structure of capacity functions for compound channels.
    Probability and Information Theory (Proc. Internat. Sympos., McMaster Univ., Hamilton, Ont., 1968) pp. 12-54, Springer, Berlin, 1969.

  6. Ahlswede, R.; Wolfowitz, J.
    The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet.
    Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 15, 186-194 (1970).

  7. Ahlswede, R.
    A note on the existence of the weak capacity for channels with arbitrarily varying channel probability functions and its relation to Shannon's zero error capacity.
    Ann. Math. Statist. 41, 1027-1033 (1970).

  8. Ahlswede, R.; Wolfowitz, J.
    Channels without synchronization.
    Advances in Appl. Probability 3, 383-403 (1971).

  9. Ahlswede, R.; Gemma, J.
    Bounds on algebraic code capacities for noisy channels. I, II.
    Information and Control 19 , 124-145 (1971); ibid. 19, 146-158 (1971).

  10. Ahlswede, R.
    Group codes do not achieve Shannon's channel capacity for general discrete channels.
    Ann. Math. Statist. 42, 224-240 (1971).

  11. Ahlswede, Rudolf
    Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback.
    Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 25, 239-252 (1972/73).

  12. Ahlswede, Rudolf
    The capacity of a channel with arbitrarily varying additive Gaussian channel probability functions.
    Transactions of the Sixth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes (Tech. Univ., Prague, 1971), pp. 13-21.
    Academia, Prague, 1973.

  13. Ahlswede, Rudolf
    On two-way communication channels and a problem by Zarankiewicz.
    Transactions of the Sixth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes (Tech. Univ., Prague, 1971), pp. 23-37.
    Academia, Prague, 1973.

  14. Ahlswede, Rudolf
    A constructive proof of the coding theorem for discrete memoryless channels with feedback.
    Transactions of the Sixth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes (Tech. Univ., Prague, 1971), pp. 39-50.
    Academia, Prague, 1973.

  15. Ahlswede, R.
    Multi-way communication channels.
    Second International Symposium on Information Theory (Tsahkadsor, 1971), pp. 23-52.
    Akadémiai Kiadó, Budapest, 1973.

  16. Ahlswede, Rudolf
    Channel capacities for list codes.
    J. Appl. Probability 10, no. 4, 824-836 (1973).

  17. Ahlswede, R.
    The capacity region of a channel with two senders and two receivers.
    Ann. Probability 2, 805-814 (1974).

  18. Ahlswede, R.; Bojanic, R.
    Approximation of continuous functions in p-adic analysis.
    J. Approximation Theory 15, no. 3, 190-205 (1975).

  19. Ahlswede, Rudolf F.; Körner, János
    Source coding with side information and a converse for degraded broadcast channels.
    IEEE Trans. Information Theory IT-21, no. 6, 629-637 (1975).

  20. Ahlswede, Rudolf; Gács, Péter
    Spreading of sets in product spaces and hypercontraction of the Markov operator.
    Ann. Probability 4, no. 6, 925-939 (1976).

  21. Ahlswede, R.; Dueck, G.
    Every bad code has a good subcode: a local converse to the coding theorem.
    Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 34, no. 2, 179-182 (1976).

  22. Ahlswede, R.; Gács, P.; Körner, J.
    Bounds on conditional probabilities with applications in multi-user communication.
    Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 34, no. 2, 157-177 (1976).

  23. Ahlswede, R.; Gács, P.; Körner, J.
    Correction to: "Bounds on conditional probabilities with applications in multi-user communication" (Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 34 (1976), 157-177).
    Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 39, no. 4, 353-354 (1977).

  24. Ahlswede, R.; Katona, G. O. H.
    Contributions to the geometry of Hamming spaces.
    Discrete Math. 17, no. 1, 1-22 (1977).

  25. Ahlswede, R.; Gács, P.
    Two contributions to information theory.
    Topics in information theory (Second Colloq., Keszthely, 1975), pp. 17-40. Colloq. Math. Soc. Janos Bolyai, Vol. 16, North-Holland, Amsterdam, 1977.

  26. Ahlswede, R.; Körner, J.
    On the connection between the entropies of input and output distributions of discrete memoryless channels.
    Proceedings of the Fifth Conference on Probability Theory (Brasov, 1974), pp. 13-22.
    Editura Acad. R.S.R., Bucharest, 1977.

  27. Ahlswede, Rudolf; Daykin, David E.
    An inequality for the weights of two families of sets, their unions and intersections.
    Z. Wahrsch. Verw. Gebiete 43, no. 3, 183-185 (1978).

  28. Ahlswede, Rudolf
    Elimination of correlation in random codes for arbitrarily varying channels.
    Z. Wahrsch. Verw. Gebiete 44, no. 2, 159-175 (1978).

  29. Ahlswede, R.; Katona, G. O. H.
    Graphs with maximal number of adjacent pairs of edges.
    Acta Math. Acad. Sci. Hungar. 32, no. 1-2, 97-120 (1978).

  30. Ahlswede, Rudolf; Daykin, David E.
    Inequalities for a pair of maps  S x S -> S  with S a finite set.
    Math. Z. 165, no. 3, 267-289 (1979).

  31. Ahlswede, Rudolf; Daykin, David E.
    The number of values of combinatorial functions.
    Bull. London Math. Soc. 11, no. 1, 49-51 (1979).

  32. Ahlswede, Rudolf
    Coloring hypergraphs: a new approach to multi-user source coding. I.
    J. Combin. Inform. System Sci. 4, no. 1, 76-115 (1979).

  33. Ahlswede, Rudolf; Daykin, David E.
    Integral inequalities for increasing functions.
    Math. Proc. Cambridge Philos. Soc. 86, no. 3, 391-394 (1979).

  34. Ahlswede, Rudolf; Wegener, Ingo
    Suchprobleme. (German) [Search problems] Teubner Studienbücher.
    B. G. Teubner, Stuttgart, 1979.

  35. Ahlswede, Rudolf
    Simple hypergraphs with maximal number of adjacent pairs of edges.
    J. Combin. Theory Ser. B 28, no. 2, 164-167 (1980).

  36. Ahlswede, Rudolf
    A method of coding and an application to arbitrarily varying channels.
    J. Combin. Inform. System Sci. 5, no. 1, 10-35 (1980).

  37. Ahlswede, Rudolf
    Coloring hypergraphs: a new approach to multi-user source coding. II.
    J. Combin. Inform. System Sci. 5, no. 3, 220-268 (1980).

  38. Ahlswede, R.; Körner, J.
    On common information and related characteristics of correlated information sources.
    included in Csiszár, I.; Körner, J. Information Theory Acad. Press, 1981.

  39. Ahlswede, Rudolf; Csiszár, Imre
    To get a bit of information may be as hard as to get full information.
    IEEE Trans. Inform. Theory 27, no. 4, 398-408 (1981).

  40. Ahlswede, Rudolf; Dueck, Gunter
    Good codes can be produced by a few permutations.
    IEEE Trans. Inform. Theory 28, no. 3, 430-443 (1982).

  41. Ahlswede, R.
    Remarks on Shannon's secrecy systems.
    Problems Control Inform. Theory/ Problemy Upravlen. Teor. Inform. 11, no. 4, 301-318 (1982).

  42. Ahlswede, Rudolph
    Jacob Wolfowitz (1910-1981).
    IEEE Trans. Inform. Theory 28, no. 5, 687-690 (1982).

  43. Ahlswede, R.; Dueck, G.
    Bad codes are good ciphers.
    Problems Control Inform. Theory/ Problemy Upravlen. Teor. Inform. 11, no. 5, 337-351 (1982).

  44. Ahlswede, Rudolf
    An elementary proof of the strong converse theorem for the multiple-access channel.
    J. Combin. Inform. System Sci. 7, no. 3, 216-230 (1982).

  45. Ahlswede, Rudolf; Han, Te Sun
    On source coding with side information via a multiple-access channel and related problems in multi-user information theory.
    IEEE Trans. Inform. Theory 29, no. 3, 396-412 (1983).

  46. Ahlswede, R.; Koschnick, K. U.
    Note on an extremal problem arising for unreliable networks in parallel computing.
    Discrete Math. 47, no. 2-3, 137-152 (1983).

  47. Ahlswede, Rudolf; El Gamal, Abbas; Pang, King F.
    A two-family extremal problem in Hamming space.
    Discrete Math. 49, no. 1, 1-5 (1984).

  48. Ahlswede, Rudolf
    Improvements of Winograd's result on computation in the presence of noise.
    IEEE Trans. Inform. Theory 30, no. 6, 872-877 (1984).

  49. Ahlswede, Rudolf
    The rate-distortion region for multiple descriptions without excess rate.
    IEEE Trans. Inform. Theory 31, no. 6, 721-726 (1985).

  50. Ahlswede, Rudolf
    On multiple descriptions and team guessing.
    IEEE Trans. Inform. Theory 32, no. 4, 543-549 (1986).

  51. Ahlswede, Rudolf
    Arbitrarily varying channels with states sequence known to the sender.
    IEEE Trans. Inform. Theory 32, no. 5, 621-629 (1986).

  52. Ahlswede, Rudolf; Csiszár, I.
    Hypothesis testing with communication constraints.
    IEEE Trans. Inform. Theory 32, no. 4, 533-542 (1986).

  53. Ahlswede, Rudolf; Kaspi, Amiram H.
    Optimal coding strategies for certain permuting channels.
    IEEE Trans. Inform. Theory 33, no. 3, 310-314 (1987).

  54. Ahlswede, Rudolf; Wegener, Ingo
    Search problems. Translated from the German by Jean E. Wotschke. Wiley-Interscience Series in Discrete Mathematics and Optimization. A Wiley-Interscience Publication.
    John Wiley & Sons, Ltd., Chichester, 1987.

  55. Ahlswede, Rudolf; Mörs, Michael
    Inequalities for code pairs.
    European J. Combin. 9, no. 2, 175-181 (1988).

  56. Ahlswede, R.
    On code pairs with specified Hamming distances.
    Combinatorics (Eger, 1987), 9-47, Colloq. Math. Soc. János Bolyai, 52,
    North-Holland, Amsterdam, 1988.

  57. Ahlswede, R.; Cai, N.; Zhang, Z.
    A general 4-words inequality with consequences for 2-way communication complexity.
    Adv. in Appl. Math. 10, no. 1, 75-94 (1989).

  58. Ahlswede, Rudolf; Dueck, Gunter
    Identification via channels.
    IEEE Trans. Inform. Theory 35, no. 1, 15-29 (1989).

  59. Ahlswede, Rudolf; Dueck, Gunter
    Identification in the presence of feedback - a discovery of new capacity formulas.
    IEEE Trans. Inform. Theory 35, no. 1, 30-36 (1989).

  60. Ahlswede, R.; Zhang, Z.
    Coding for write-efficient memory.
    Inform. and Comput. 83, no. 1, 80-97 (1989).

  61. Ahlswede, R.; Zhang, Z.
    Contributions to a theory of ordering for sequence spaces.
    Problems Control Inform. Theory/ Problemy Upravlen. Teor. Inform. 18, no. 4, 197-221 (1989).

  62. Ahlswede, R.; Burnashev, M. V.
    On minimax estimation in the presence of side information about remote data.
    Ann. Statist. 18, no. 1, 141-171 (1990).

  63. Ahlswede, R.; Zhang, Z.
    An identity in combinatorial extremal theory.
    Adv. Math. 80, no.2, 137-151 (1990).

  64. Ahlswede, Rudolf
    Extremal properties of rate-distortion functions.
    IEEE Trans. Inform. Theory 36,no. 1, 166-171 (1990).

  65. Ahlswede, R.; Zhang, Z.
    On cloud-antichains and related configurations.
    Discrete Math. 85, no. 3, 225-245 (1990).

  66. Ahlswede, R.; Cai, N.; Zhang, Z.
    A recursive bound for the number of complete K-subgraphs of a graph.
    Topics in combinatorics and graph theory (Oberwolfach, 1990), 37-39,
    Physica, Heidelberg, 1990.

  67. Ahlswede, Rudolf
    Coding for channels with localized errors: the nonbinary cases.
    Appl. Math. Lett. 3, no. 3, 5-8 (1990).

  68. Ahlswede, Rudolf; Ye, Jian Ping; Zhang, Zhen
    Creating order in sequence spaces with simple machines.
    Inform. and Comput. 89, no. 1, 47-94 (1990).

  69. Ahlswede, Rudolf; Simonyi, Gábor
    Reusable memories in the light of the old arbitrarily varying and a new outputwise varying channel theory.
    IEEE Trans. Inform. Theory 37, no. 4, 1143-1150 (1991).

  70. Ahlswede, Rudolf; Verboven, Bart
    On identification via multi-way channels with feedback.
    IEEE Trans. Inform. Theory 37, no. 6, 1519-1526 (1991).

  71. Ahlswede, R.; Cai, N.; Zhang, Z.
    Diametric theorems in sequence spaces.
    Combinatorica 12, no. 1, 1-17 (1992).

  72. Ahlswede, Rudolf; Cai, Ning
    Two proofs of Pinsker's conjecture concerning arbitrarily varying channels.
    IEEE Trans. Inform. Theory 37, no. 6, 1647-1649 (1991).

  73. Ahlswede, R.; Cai, N.; Zhang, Z.
    Rich colorings with local constraints.
    J. Combin. Inform. System Sci. 17, no. 3-4, 203-216 (1992).

  74. Ahlswede, R.; Bezrukov, S. L.; Blokhuis, A.; Metsch, K.; Moorhouse, G. E.
    Partitioning the n-cube into sets with mutual distance 1.
    Appl. Math. Lett. 6, no. 4, 17-19 (1993).

  75. Ahlswede, Rudolf; Cai, Ning
    A generalization of the AZ identity.
    Combinatorica 13, no. 3, 241-247 (1993).

  76. Ahlswede, Rudolf; Cai, Ning
    Rank formulas for certain products of matrices.
    Appl. Algebra Engrg. Comm. Comput. 4, no. 4, 253-261 (1993).

  77. Ahlswede, Rudolph; Csiszár, Imre
    Common randomness in information theory and cryptography. I. Secret sharing.
    IEEE Trans. Inform. Theory 39, no. 4, 1121-1132 (1993).

  78. Ahlswede, R.; Bassalygo, L. A.; Pinsker, M. S.
    Nonbinary codes correcting localized errors.
    IEEE Trans. Inform. Theory 39, no. 4, 1413-1416 (1993).

  79. Ahlswede, Rudolph
    The maximal error capacity of AV channels for constant list sizes.
    IEEE Trans. Inform. Theory 39, no. 4, 1416-1417 (1993).

  80. Ahlswede, R.; Bassalygo, L. A.; Pinsker, M. S.
    Asymptotically dense nonbinary codes correcting a constant number of localized errors.
    C. R. Acad. Bulgare Sci. 46, no. 1, 35-37 (1993).

  81. Ahlswede, Rudolf; Cai, Ning
    On extremal set partitions in Cartesian product spaces.
    Combin. Probab. Comput. 2, no. 3, 211-220 (1993).

  82. Ahlswede, Rudolf; Cai, Ning; Tamm, Ulrich
    Communication complexity in lattices.
    Appl. Math. Lett. 6, no. 6, 53-58 (1993).

  83. Ahlswede, R.; Bassalygo, L. A.; Pinsker, M. S.
    Binary constant-weight codes that correct localized errors and defects. (Russian)
    Problemy Peredachi Informatsii 30, no. 2, 10-13 (1994);
    translation in Problems Inform. Transmission 30, no. 2, 102-104 (1994).

  84. Ahlswede, Rudolf; Simonyi, Gábor
    On the optimal structure of recovering set pairs in lattices: the sandglass conjecture.
    Discrete Math. 128, no. 1-3, 389-394 (1994).

  85. Ahlswede, Rudolf; Khachatrian, Levon H.
    On extremal sets without coprimes.
    Acta Arith. 66, no. 1, 89-99 (1994).

  86. Ahlswede, Rudolf; Althöfer, Ingo
    The asymptotic behaviour of diameters in the average.
    J. Combin. Theory Ser. B 61, no. 2, 167-177 (1994).

  87. Ahlswede, Rudolf; Khachatrian, Levon H.
    The maximal length of cloud-antichains.
    Discrete Math. 131, no. 1-3, 9-15 (1994).

  88. Ahlswede, R.; Cai, N.
    Two-way communication complexity of sum-type functions for one processor to be informed.(Russian)
    Problemy Peredachi Informatsii 30, no. 1, 3-12 (1994);
    translation in Problems Inform. Transmission 30, no. 1, 1-10 (1994).

  89. Ahlswede, Rudolf; Cai, Ning
    On partitioning and packing products with rectangles.
    Combin. Probab. Comput. 3, no. 4, 429-434 (1994).

  90. Ahlswede, Rudolf; Zhang, Z.
    On multiuser write-efficient memories.
    IEEE Trans. Inform. Theory 40, no. 3, 674-686 (1994).

  91. Ahlswede, Rudolf; Cai, Ning
    On communication complexity of vector-valued functions.
    IEEE Trans. Inform. Theory 40, no. 6, 2062-2067 (1994).

  92. Ahlswede, R.; Cai, Ning
    On sets of words with pairwise common letter in different positions.
    Extremal problems for finite sets (Visegrád, 1991), 25-38, Bolyai Soc. Math. Stud., 3,
    János Bolyai Math. Soc., Budapest, 1994.

  93. Ahlswede, R.; Cai, N.; Zhang, Z.
    A new direction in extremal theory.
    J. Combin. Inform. System Sci. 19, no. 3-4, 269-280 (1994).

  94. Ahlswede, R.; Bassalygo, L. A.; Pinsker, M. S.
    Localized random and arbitrary errors in the light of AV channel theory.
    IEEE Trans. Inform. Theory 41, no. 1, 14-25 (1995).

  95. Ahlswede, R.; Zhang, Z.
    New directions in the theory of identification via channels.
    IEEE Trans. Inform. Theory 41, no. 4, 1040-1050 (1995).

  96. Ahlswede, R.; Bassalygo, L. A.; Pinsker, M. S.
    Asymptotically optimal binary codes of polynomial complexity that correct localized errors. (Russian)
    Problemy Peredachi Informatsii 31, no. 2, 76-83 (1995);
    translation in Problems Inform. Transmission 31, no. 2, 162-168 (1995).

  97. Ahlswede, R.; Bezrukov, S. L.
    Edge isoperimetric theorems for integer point arrays.
    Appl. Math. Lett. 8, no. 2, 75-80 (1995).

  98. Ahlswede, Rudolf; Erdös, Péter L.; Graham, Niall
    A splitting property of maximal antichains.
    Combinatorica 15, no. 4, 475-480 (1995).

  99. Ahlswede, Rudolf; Khachatrian, Levon H.
    Towards characterizing equality in correlation inequalities.
    European J. Combin. 16, no. 4, 315-328 (1995).

  100. Ahlswede, Rudolf; Khachatrian, Levon H.
    Maximal sets of numbers not containing k+1 pairwise coprime integers.
    Acta Arith. 72, no. 1, 77-100 (1995).

  101. Ahlswede, Rudolf; Khachatrian, Levon H.
    Density inequalities for sets of multiples.
    J. Number Theory 55, no. 2, 170-180 (1995).

  102. Ahlswede, R.; Khachatrian, L. H.
    A counterexample to Aharoni's strongly maximal matching conjecture.
    Discrete Math. 149, no. 1-3, 289 (1996).

  103. Ahlswede, Rudolf; Khachatrian, Levon H.
    Sets of integers and quasi-integers with pairwise common divisor.
    Acta Arith. 74, no. 2, 141-153 (1996).

  104. Ahlswede, Rudolf; Khachatrian, Levon H.
    Sets of integers with pairwise common divisor and a factor from a specified set of primes.
    Acta Arith. 75, no. 3, 259-276 (1996).

  105. Ahlswede, Rudolf; Khachatrian, Levon H.
    Optimal pairs of incomparable clouds in multisets.
    Graphs Combin. 12, no. 2, 97-137 (1996).

  106. Ahlswede, R.; Gargano, L.; Haroutunian, H. S.; Khachatrian, L. H.
    Fault-tolerant minimum broadcast networks.
    Networks 27, no. 4, 293-307 (1996).

  107. Ahlswede, Rudolf; Khachatrian, Levon H.
    The complete nontrivial-intersection theorem for systems of finite sets.
    J. Combin. Theory Ser. A 76, no. 1, 121-138 (1996).

  108. Ahlswede, R.; Balakirsky, V. B.
    Identification by means of a random process. (Russian)
    Problemy Peredachi Informatsii 32, no. 1, 144-160 (1996);
    translation in Problems Inform. Transmission 32, no. 1, 123-138 (1996).

  109. Ahlswede, Rudolf; Cai, Ning
    Incomparability and intersection properties of Boolean interval lattices and chain posets.
    European J. Combin. 17, no. 8, 677-687 (1996).

  110. Ahlswede, Rudolf; Cai, Ning
    On extremal set partitions in Cartesian product spaces.
    Combinatorics, geometry and probability (Cambridge, 1993), 23-32,
    Cambridge Univ. Press, Cambridge, 1997.

  111. Ahlswede, Rudolf; Yang, En-hui; Zhang, Zhen
    Identification via compressed data.
    IEEE Trans. Inform. Theory 43, no. 1, 48--70 (1997).

  112. Ahlswede, Rudolf; Khachatrian, Levon H.
    Classical results on primitive and recent results on cross-primitive sequences.
    The mathematics of Paul Erdös, I, 104-116, Algorithms Combin., 13,
    Springer, Berlin, 1997.

  113. Ahlswede, Rudolf; Khachatrian, Levon H.
    The complete intersection theorem for systems of finite sets.
    European J. Combin. 18, no. 2, 125-136 (1997).

  114. Ahlswede, Rudolf; Cai, Ning; Zhang, Zhen
    On interactive communication.
    IEEE Trans. Inform. Theory 43, no. 1, 22-37 (1997).

  115. Ahlswede, Rudolf; Han, Te Sun; Kobayashi, Kingo
    Universal coding of integers and unbounded search trees.
    IEEE Trans. Inform. Theory 43, no. 2, 669-682 (1997).

  116. Ahlswede, R.; Alon, N.; Erdös, P. L.; Ruszinkó, M.; Székely, L. A.
    Intersecting systems.
    Combin. Probab. Comput. 6, no. 2, 127-137 (1997).

  117. Ahlswede, Rudolf; Cai, Ning
    Cross-disjoint pairs of clouds in the interval lattice.
    The mathematics of Paul Erdös, I, 155-164, Algorithms Combin., 13,
    Springer, Berlin, 1997.

  118. Ahlswede, Rudolf; Khachatrian, Levon H.
    Number-theoretic correlation inequalities for Dirichlet densities.
    J. Number Theory 63, no. 1, 34-46 (1997).

  119. Ahlswede, Rudolf; Cai, Ning
    General edge-isoperimetric inequalities. I. Informationtheoretical methods.
    European J. Combin. 18, no. 4, 355-372 (1997).

  120. Ahlswede, Rudolf; Cai, Ning
    Models of multi-user write-efficient memories and general diametric theorems.
    Inform. and Comput. 135, no. 1, 37-67 (1997).

  121. Ahlswede, Rudolf; Cai, Ning
    Correlated sources help transmission over an arbitrarily varying channel.
    IEEE Trans. Inform. Theory 43, no. 4, 1254-1255 (1997).

  122. Ahlswede, Rudolf; Cai, Ning
    General edge-isoperimetric inequalities. II. A local-global principle for lexicographical solutions.
    European J. Combin. 18, no. 5, 479-489 (1997).

  123. Ahlswede, Rudolf; Cai, Ning
    Shadows and isoperimetry under the sequence-subsequence relation.
    Combinatorica 17, no. 1, 11-29 (1997).

  124. Ahlswede, R.; Khachatrian, L. H.
    Counterexample to the Frankl/Pach conjecture for uniform, dense families.
    Combinatorica 17, no. 2, 299-301 (1997).

  125. Ahlswede, Rudolf; Csiszár, Imre
    Common randomness in information theory and cryptograpy. II. CR capacity.
    IEEE Trans. Inform. Theory 44, no. 1, 225-240 (1998).

  126. Ahlswede, R.; Aydinian, H.; Khachatrian, L. H.
    The intersection theorem for direct products.
    European J. Combin. 19 (1998), no. 6, 649--661.

  127. Ahlswede, Rudolf; Cai, Ning
    Information and control: matching channels.
    IEEE Trans. Inform. Theory 44 (1998), no. 2, 542--563.

  128. Ahlswede, R.; Zhang, Z.
    Code pairs with specified parity of the Hamming distances.
    Discrete Math. 188 (1998), no. 1-3, 1--11.

  129. Ahlswede, R.; Cai, N.
    Isoperimetric theorems in the binary sequences of finite lengths.
    Appl. Math. Lett. 11 (1998), no. 5, 121--126.

  130. Ahlswede, Rudolf; Khachatrian, Levon H.
    The diametric theorem in Hamming spaces---optimal anticodes.
    Adv. in Appl. Math. 20 (1998), no. 4, 429--449.

  131. Ahlswede, Rudolf; Cai, Ning; Zhang, Zhen
    Zero-error capacity for models with memory and the enlightened dictator channel.
    IEEE Trans. Inform. Theory 44 (1998), no. 3, 1250--1252.

  132. Ahlswede, Rudolf; Zhang, Zhen
    On maximal shadows of members in left-compressed sets.
    Discrete Appl. Math. 95 (1999), no. 1-3, 3--9.

  133. Ahlswede, Rudolf; Cai, Ning
    Arbitrarily varying multiple-access channels. II. Correlated senders' side information, correlated messages, and ambiguous transmission.
    IEEE Trans. Inform. Theory 45 (1999), no. 2, 749--756.

  134. Ahlswede, Rudolf; Cai, Ning
    Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true.
    IEEE Trans. Inform. Theory 45 (1999), no. 2, 742--749.

  135. Ahlswede, Rudolf; Balakirsky, Vladimir B.
    Construction of uniquely decodable codes for the two-user binary adder channel.
    IEEE Trans. Inform. Theory 45 (1999), no. 1, 326--330.


icon Hauptseite icon main site
 
For any questions and problems with this web site please email to cdeppe@Mathematik.Uni-Bielefeld.DE. Last change: 12/10/1998