The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rudolf Ahlswede: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rudolf Ahlswede, Ning Cai
    Appendix: On Edge-Isoperimetric Theorems for Uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:979-1005 [Conf]
  2. Rudolf Ahlswede, Iskandar Karapetyan
    Intersection Graphs of Rectangles and Segments. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:1064-1065 [Conf]
  3. Rudolf Ahlswede, Zheng Zhang
    Estimating with Randomized Encoding the Joint Empirical Distribution in a Correlated Source. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:535-546 [Conf]
  4. Rudolf Ahlswede, Ning Cai, Zhaozhi Zhang
    Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:285-292 [Conf]
  5. Rudolf Ahlswede, Christian Mauduit, András Sárközy
    Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part I. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:293-307 [Conf]
  6. Rudolf Ahlswede, Christian Mauduit, András Sárközy
    Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part II. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:308-325 [Conf]
  7. Rudolf Ahlswede, Mark S. Pinsker
    Report on Models of Write-Efficient Memories with Localized Errors and Defects. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:628-632 [Conf]
  8. Søren Riis, Rudolf Ahlswede
    Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis "Utilising Public Information in Network Coding". [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:861-897 [Conf]
  9. Rudolf Ahlswede, Evgueni A. Haroutunian
    On Logarithmically Asymptotically Optimal Testing of Hypotheses and Identification. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:553-571 [Conf]
  10. Rudolf Ahlswede, János Körner
    Appendix: On Common Information and Related Characteristics of Correlated Information Sources. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:664-677 [Conf]
  11. Rudolf Ahlswede, Alexander Yudin
    On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:941-954 [Conf]
  12. Rudolf Ahlswede
    Introduction. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:1-44 [Conf]
  13. Rudolf Ahlswede
    Rudolf Ahlswede - From 60 to 66. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:45-48 [Conf]
  14. Rudolf Ahlswede
    Information Theory and Some Friendly Neighbors - Ein Wunschkonzert. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:49-50 [Conf]
  15. Rudolf Ahlswede
    Identification Entropy. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:595-613 [Conf]
  16. Rudolf Ahlswede
    On Concepts of Performance Parameters for Channels. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:639-663 [Conf]
  17. Rudolf Ahlswede
    An Outside Opinion. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:858-860 [Conf]
  18. Rudolf Ahlswede
    Appendix: On Set Coverings in Cartesian Product Spaces. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:926-937 [Conf]
  19. Rudolf Ahlswede
    Appendix: Solution of Burnashev's Problem and a Sharpening of the Erdös/Ko/Rado Theorem. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:1006-1009 [Conf]
  20. Rudolf Ahlswede
    Finding CNRI(W), the Identification Capacity of the AVC W, if Randomization in the Encoding Is Excluded. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:1063- [Conf]
  21. Rudolf Ahlswede, Harout K. Aydinian
    Sparse Asymmetric Connectors in Communication Networks. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:1056-1062 [Conf]
  22. Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe
    Information Theoretic Models in Language Evolution. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:769-787 [Conf]
  23. Rudolf Ahlswede, Ella Aloyan, Evgueni A. Haroutunian
    On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Sources with Side Information. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:547-552 [Conf]
  24. Rudolf Ahlswede, Vladimir Blinovsky
    Correlation Inequalities in Function Spaces. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:572-577 [Conf]
  25. Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich
    A Fast Suffix-Sorting Algorithm. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:719-734 [Conf]
  26. Rudolf Ahlswede, Bernhard Balkenhol, Christian Kleinewächter
    Identification for Sources. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:51-61 [Conf]
  27. Rudolf Ahlswede, Ning Cai
    Watermarking Identification Codes with Related Topics on Common Randomness. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:107-153 [Conf]
  28. Rudolf Ahlswede, Ning Cai
    Codes with the Identifiable Parent Property and the Multiple-Access Channel. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:249-257 [Conf]
  29. Rudolf Ahlswede, Ning Cai
    Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:258-275 [Conf]
  30. Rudolf Ahlswede, Ning Cai
    A Strong Converse Theorem for Quantum Multiple Access Channels. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:460-485 [Conf]
  31. Rudolf Ahlswede, Ning Cai
    Search with Noisy and Delayed Responses. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:695-703 [Conf]
  32. Rudolf Ahlswede, Ning Cai
    A Kraft-Type Inequality for d-Delay Binary Search Codes. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:704-706 [Conf]
  33. Rudolf Ahlswede, Levon H. Khachatrian
    On Attractive and Friendly Sets in Sequence Spaces. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:955-970 [Conf]
  34. Rudolf Ahlswede, Ning Cai
    Rank Formulas for Certain Products of Matrices. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1993, v:4, n:, pp:253-261 [Journal]
  35. Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
    Maximum Number of Constant Weight Vertices of the Unit n-Cube Contained in a k-Dimensional Subspace. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:1, pp:5-22 [Journal]
  36. Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
    On Shadows Of Intersecting Families. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:4, pp:555-566 [Journal]
  37. Rudolf Ahlswede, Ning Cai
    A generalization of the AZ identity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:3, pp:241-248 [Journal]
  38. Rudolf Ahlswede, Ning Cai
    Shadows and Isoperimetry Under the Sequence-Subsequence Relation. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:1, pp:11-29 [Journal]
  39. Rudolf Ahlswede, Ning Cai, Zhen Zhang
    Diametric theorems in seuence spaces. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:1, pp:1-17 [Journal]
  40. Rudolf Ahlswede, Péter L. Erdös, Niall Graham
    A Splitting Property of Maximal Antichains. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:4, pp:475-480 [Journal]
  41. Rudolf Ahlswede, Levon H. Khachatrian
    Katona's Intersection Theorem: Four Proofs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:25, n:1, pp:105-110 [Journal]
  42. Rudolf Ahlswede, Levon H. Khachatrian
    Counterexample to the Frankl-Pach Conjecture for Uniform, Dense Families. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:2, pp:299-301 [Journal]
  43. Rudolf Ahlswede, Levon H. Khachatrian
    A Pushing-Pulling Method: New Proofs of Intersection Theorems. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:1, pp:1-15 [Journal]
  44. Rudolf Ahlswede, Noga Alon, Péter L. Erdös, Miklós Ruszinkó, László A. Székely
    Intersecting Systems. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:2, pp:127-137 [Journal]
  45. Rudolf Ahlswede, Ning Cai
    On Extremal Set Partitions in Cartesian Product Spaces. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:211-220 [Journal]
  46. Rudolf Ahlswede, Ning Cai
    On Partitioning and Packing Products with Rectangles. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:429-434 [Journal]
  47. Rudolf Ahlswede, Ning Cai
    A Counterexample To Kleitman's Conjecture Concerning An Edge-Isoperimetric Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1999, v:8, n:4, pp:- [Journal]
  48. Rudolf Ahlswede, Zhen Zhang
    On Maximal Shadows of Members in Left-compressed Sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:3-9 [Journal]
  49. Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
    On Perfect Codes and Related Concepts. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:22, n:3, pp:221-237 [Journal]
  50. Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
    Forbidden (0, 1)-Vectors in Hyperplanes of Rn: The Restricted Case. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:17-28 [Journal]
  51. Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
    Forbidden (0, 1)-vectors in Hyperplanes of Rn: The unrestricted case. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:37, n:1, pp:151-167 [Journal]
  52. Rudolf Ahlswede, Levon H. Khachatrian
    Cone Dependence - A Basic Combinatorial Concept. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:29-40 [Journal]
  53. Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
    Extremal problems under dimension constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:273, n:1-3, pp:9-21 [Journal]
  54. Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
    Maximal antichains under dimension constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:273, n:1-3, pp:23-29 [Journal]
  55. Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
    More about shifting techniques. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2003, v:24, n:5, pp:551-556 [Journal]
  56. Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
    The Intersection Theorem for Direct Products. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:6, pp:649-661 [Journal]
  57. Rudolf Ahlswede, Christian Bey, Konrad Engel, Levon H. Khachatrian
    The t-intersection Problem in the Truncated Boolean Lattice. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:5, pp:471-487 [Journal]
  58. Rudolf Ahlswede, Ning Cai
    Incomparability and Intersection Properties of Boolean Interval Lattices and Chain Posets. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:8, pp:677-687 [Journal]
  59. Rudolf Ahlswede, Ning Cai
    General Edge-isoperimetric Inequalities, Part I: Information-theoretical Methods. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1997, v:18, n:4, pp:355-372 [Journal]
  60. Rudolf Ahlswede, Ning Cai
    General Edge-isoperimetric Inequalities, Part II: a Local-Global Principle for Lexicographical Solutions. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1997, v:18, n:5, pp:479-489 [Journal]
  61. Rudolf Ahlswede, Levon H. Khachatrian
    The Complete Intersection Theorem for Systems of Finite Sets. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1997, v:18, n:2, pp:125-136 [Journal]
  62. Rudolf Ahlswede, Ning Cai
    Models of Multi-User Write-Efficient Memories and General Diametric Theorems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:135, n:1, pp:37-67 [Journal]
  63. Rudolf Ahlswede, J. Gemma
    Bounds on Algebraic Code Capacities for Noisy Channels. I [Citation Graph (0, 0)][DBLP]
    Information and Control, 1971, v:19, n:2, pp:124-145 [Journal]
  64. Rudolf Ahlswede, J. Gemma
    Bounds on Algebraic Code Capacities for Noisy Channels. II [Citation Graph (0, 0)][DBLP]
    Information and Control, 1971, v:19, n:2, pp:146-158 [Journal]
  65. Rudolf Ahlswede, Jacob Wolfowitz
    Correlated Decoding for Channels with Arbitrarily Varying Channel Probability Functions [Citation Graph (0, 0)][DBLP]
    Information and Control, 1969, v:14, n:5, pp:457-473 [Journal]
  66. Rudolf Ahlswede, Jian-ping Ye, Zhen Zhang
    Creating Order in Sequence Spaces with Simple Machines [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:89, n:1, pp:47-94 [Journal]
  67. Rudolf Ahlswede, Zhen Zhang
    Coding for Write-Efficient Memory [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:83, n:1, pp:80-97 [Journal]
  68. Rudolf Ahlswede, Ingo Althöfer
    The Asymptotic Behavior of Diameters in the Average. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:61, n:2, pp:167-177 [Journal]
  69. Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
    Intersection theorems under dimension constraints. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:3, pp:483-519 [Journal]
  70. Rudolf Ahlswede, Levon H. Khachatrian
    The Complete Nontrivial-Intersection Theorem for Systems of Finite Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:76, n:1, pp:121-138 [Journal]
  71. Rudolf Ahlswede, Vladimir Blinovsky
    Maximal sets of numbers not containing k+1 pairwise coprimes and having divisors from a specified set of primes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:8, pp:1621-1628 [Journal]
  72. Rudolf Ahlswede, Harout K. Aydinian
    Construction of asymmetric connectors of depth two. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:8, pp:1614-1620 [Journal]
  73. Rudolf Ahlswede
    Simple hypergraphs with maximal number of adjacent pairs of edges. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:164-167 [Journal]
  74. Rudolf Ahlswede, Ning Cai
    Arbitrarily Varying Multiple-Access Channels Part I - Ericson's Symmetrizability Is Adequate, Gubner's Conjecture Is True. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:742-749 [Journal]
  75. Rudolf Ahlswede, Ning Cai
    Information and Control: Matching Channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:2, pp:542-563 [Journal]
  76. Rudolf Ahlswede, Ning Cai
    Arbitrarily Varying Multiple-Access Channels - Part II - Correlated Senders' Side Information, Correlated Messages, and Ambiguous Transmission. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:749-756 [Journal]
  77. Rudolf Ahlswede, Bernhard Balkenhol, Ning Cai
    Parallel error correcting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:4, pp:959-962 [Journal]
  78. Rudolf Ahlswede, Leonid A. Bassalygo, Mark S. Pinsker
    Nonbinary codes correcting localized errors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1413-0 [Journal]
  79. Rudolf Ahlswede, Leonid A. Bassalygo, Mark S. Pinsker
    Localized random and arbitrary errors in the light of arbitrarily varying channel theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:1, pp:14-25 [Journal]
  80. Rudolf Ahlswede, Ning Cai
    Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:8, pp:2153-2162 [Journal]
  81. Rudolf Ahlswede, Ning Cai
    On Lossless Quantum Data Compression With a Classical Helper. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:6, pp:1208-1219 [Journal]
  82. Rudolf Ahlswede, Imre Csiszár
    To get a bit of information may be as hard as to get full information. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:4, pp:398-408 [Journal]
  83. Rudolf Ahlswede, Imre Csiszár
    Hypothesis testing with communication constraints. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:4, pp:533-542 [Journal]
  84. Rudolf Ahlswede, Ning Cai
    Two proofs of Pinsker's conjecture concerning arbitrarily varying channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1647-0 [Journal]
  85. Rudolf Ahlswede, Ning Cai
    Identification without randomization. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2636-2642 [Journal]
  86. Rudolf Ahlswede, Ning Cai, Shuo-Yen Robert Li, Raymond W. Yeung
    Network information flow. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1204-1216 [Journal]
  87. Rudolf Ahlswede, Imre Csiszár
    Common randomness in information theory and cryptography - I: Secret sharing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1121-1132 [Journal]
  88. Rudolf Ahlswede, Ning Cai, Zhen Zhang
    Erasure, list, and detection zero-error capacities for low noise and a relation to identification. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:55-62 [Journal]
  89. Rudolf Ahlswede, Ning Cai
    On communication complexity of vector-valued functions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:6, pp:2062-0 [Journal]
  90. Rudolf Ahlswede, Ning Cai, Zhen Zhang
    On interactive communication. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:22-37 [Journal]
  91. Rudolf Ahlswede, Ning Cai, Zhen Zhang
    Zero-Error Capacity for Models with Memory and the Enlightened Dictator Channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:3, pp:1250-1252 [Journal]
  92. Rudolf Ahlswede, Gunter Dueck
    Good codes can be produced by a few permutations. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1982, v:28, n:3, pp:430-442 [Journal]
  93. Rudolf Ahlswede, Gunter Dueck
    Identification via channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:1, pp:15-29 [Journal]
  94. Rudolf Ahlswede, Gunter Dueck
    Identification in the presence of feedback-A discovery of new capacity formulas. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:1, pp:30-36 [Journal]
  95. Rudolf Ahlswede, Te Sun Han
    On source coding with side information via a multiple-access channel and related problems in multi-user information theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:396-411 [Journal]
  96. Rudolf Ahlswede, Te Sun Han, Kingo Kobayashi
    Universal coding of integers and unbounded search trees. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:2, pp:669-682 [Journal]
  97. Rudolf Ahlswede, Amiram H. Kaspi
    Optimal coding strategies for certain permuting channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:310-314 [Journal]
  98. Rudolf Ahlswede, Peter Löber
    Quantum data processing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:474-478 [Journal]
  99. Rudolf Ahlswede, Gábor Simonyi
    Reusable memories in the light of the old arbitrarily varying-and a new outputwise varying channel theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:4, pp:1143-1150 [Journal]
  100. Rudolf Ahlswede, Bart Verboven
    On identification via multiway channels with feedback. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1519-1526 [Journal]
  101. Rudolf Ahlswede, Andreas Winter
    Strong converse for identification via quantum channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:3, pp:569-579 [Journal]
  102. Rudolf Ahlswede, Andreas Winter
    Addendum to "Strong converse for identification via quantum channels". [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:1, pp:346- [Journal]
  103. Rudolf Ahlswede, Ning Cai
    Correlated sources help transmission over an arbitrarily varying channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:4, pp:1254-1255 [Journal]
  104. Rudolf Ahlswede, En-Hui Yang, Zhen Zhang
    Identification via compressed data. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:48-70 [Journal]
  105. Rudolf Ahlswede, Zhen Zhang
    On multiuser write-efficient memories. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:3, pp:674-686 [Journal]
  106. Rudolf Ahlswede, Zhen Zhang
    New directions in the theory of identification via channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:4, pp:1040-1050 [Journal]
  107. Rudolf Ahlswede
    Improvements of Winograd's result on computation in the presence of noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:6, pp:872-0 [Journal]
  108. Rudolf Ahlswede
    The rate-distortion region for multiple descriptions without excess rate. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:6, pp:721-726 [Journal]
  109. Rudolf Ahlswede
    On multiple descriptions and team guessing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:4, pp:543-549 [Journal]
  110. Rudolf Ahlswede
    Arbitrarily varying channels with states sequence known to the sender. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:5, pp:621-629 [Journal]
  111. Rudolf Ahlswede
    Extremal properties of rate distortion functions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:1, pp:166-0 [Journal]
  112. Rudolf Ahlswede
    The maximal error capacity of arbitrarily varying channels for constant list sizes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1416-0 [Journal]
  113. Rudolf Ahlswede, Vladimir B. Balakirsky
    Construction of Uniquely Decodable Codes for the Two-User Binary Adder Channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:1, pp:326-330 [Journal]
  114. Rudolf Ahlswede, Imre Csiszár
    Common Randomness in Information Theory and Cryptography - Part II: CR Capacity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:225-240 [Journal]
  115. Rudolf Ahlswede, A. Cai
    An Interpretation of Identification Entropy. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:9, pp:4198-4207 [Journal]
  116. Rudolf Ahlswede, Vladimir Blinovsky
    Classical Capacity of Classical-Quantum Arbitrarily Varying Channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:2, pp:526-533 [Journal]
  117. Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian, Ludo M. G. M. Tolhuizen
    On q-ary codes correcting all unidirectional errors of a limited magnitude [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  118. Rudolf Ahlswede, Klaus-Uwe Koschnick
    Note on an extremal problem arising for unreliable networks in parallel computing. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:137-152 [Journal]
  119. Rudolf Ahlswede, Abbas El Gamal, King F. Pang
    A two-family extremal problem in hamming space. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:49, n:1, pp:1-5 [Journal]
  120. Rudolf Ahlswede, Z. Zhang
    Code pairs with specified parity of the Hamming distances. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:1-11 [Journal]
  121. Rudolf Ahlswede, Z. Zhang
    On cloud-antichains and related configurations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:3, pp:225-245 [Journal]
  122. Rudolf Ahlswede, Levon H. Khachatrian
    A counterexample to Aharoni's strongly maximal matching conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:149, n:1-3, pp:289- [Journal]
  123. Rudolf Ahlswede, Levon H. Khachatrian
    The maximal length of cloud-antichains. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:131, n:1-3, pp:9-15 [Journal]
  124. Rudolf Ahlswede, Gábor Simonyi
    On the optimal structure of recovering set pairs in lattices: the sandglass conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:128, n:1-3, pp:389-394 [Journal]

  125. 06201 Executive Summary -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. [Citation Graph (, )][DBLP]


  126. Non--binary error correcting codes with noiseless feedback, localized errors, or both. [Citation Graph (, )][DBLP]


  127. 06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. [Citation Graph (, )][DBLP]


  128. Interactive Communication, Diagnosis and Error Control in Networks. [Citation Graph (, )][DBLP]


  129. A Diametric Theorem in Z nm for Lee and Related Distances. [Citation Graph (, )][DBLP]


  130. Ratewise-optimal non-sequential search strategies under constraints on the tests. [Citation Graph (, )][DBLP]


  131. On the correlation of binary sequences. [Citation Graph (, )][DBLP]


  132. Multiple packing in sum-type metric spaces. [Citation Graph (, )][DBLP]


  133. Preface. [Citation Graph (, )][DBLP]


  134. General theory of information transfer: Updated. [Citation Graph (, )][DBLP]


  135. Searching with lies under error cost constraints. [Citation Graph (, )][DBLP]


  136. T-shift synchronization codes. [Citation Graph (, )][DBLP]


  137. On diagnosability of large multiprocessor networks. [Citation Graph (, )][DBLP]


Search in 0.060secs, Finished in 0.067secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002