Rudolf Ahlswede

ahlswede@math.uni-bielefeld.de
PEVZ-ID
10479

206 Publikationen

Alle markieren

  • [206]
    2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2560225
    R. Ahlswede, et al., “Quantum Capacity under Adversarial Quantum Noise: Arbitrarily Varying Quantum Channels”, Communications In Mathematical Physics, vol. 317, 2013, pp. 103-156.
    PUB | DOI | WoS
     
  • [205]
    2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656530
    R. Ahlswede, C. Deppe, and V. Lebedev, “Threshold and Majority Group Testing”, Information Theory, Combinatorics, and Search Theory, H. Aydinian, F. Cicalese, and C. Deppe, eds., Lecture Notes in Computer Science, vol. 7777, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp.488-508.
    PUB | DOI
     
  • [204]
    2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2489365
    R. Ahlswede and H. Aydinian, “On Generic Erasure Correcting Sets and Related Problems”, IEEE Transactions on Information Theory, vol. 58, 2012, pp. 501-508.
    PUB | DOI | WoS
     
  • [203]
    2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2518066
    R. Ahlswede, C. Deppe, and V.S. Lebedev, “Finding one of D defective elements in some group testing models”, Problems of Information Transmission, vol. 48, 2012, pp. 173-181.
    PUB | DOI | WoS
     
  • [202]
    2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1634814
    R. Ahlswede, et al., “Two Batch Search With Lie Cost”, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 55, 2009, pp. 1433-1439.
    PUB | DOI | WoS
     
  • [201]
    2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1636468
    R. Ahlswede and H. Aydinian, “On diagnosability of large multiprocessor networks”, Discrete Applied Mathematics, vol. 156, 2008, pp. 3464-3474.
    PUB | DOI | WoS
     
  • [200]
    2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1592906
    R. Ahlswede and H. Aydinian, “Error control codes for parallel asymmetric channels”, IEEE Transactions on Information Theory, vol. 54, 2008, pp. 831-836.
    PUB | DOI | WoS
     
  • [199]
    2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587905
    R. Ahlswede and V. Blinovsky, “Multiple packing in sum-type metric spaces”, DISCRETE APPLIED MATHEMATICS, vol. 156, 2008, pp. 1469-1477.
    PUB | DOI | WoS
     
  • [198]
    2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1587909
    R. Ahlswede, J. Cassaigne, and A. Sarközy, “On the correlation of binary sequences”, Discrete Applied Mathematics, DISCRETE APPLIED MATHEMATICS, vol. 156, ELSEVIER SCIENCE BV, 2008, pp.1478-1487.
    PUB | DOI | WoS
     
  • [197]
    2008 | Sonderausgabe Zeitschrift | Veröffentlicht | PUB-ID: 2450290
    R. Ahlswede, N. Cai, and L. Bäumer, eds., “General theory of information transfer and combinatorics”, Discrete applied mathematics, vol. 156, 2008.
    PUB
     
  • [196]
    2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1860133
    R. Ahlswede, et al., “T-Shift synchronization codes”, Discrete Applied Mathematics, vol. 156, 2008, pp. 1461-1468.
    PUB | DOI | WoS
     
  • [195]
    2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587890
    R. Ahlswede, “Ratewise-optimal non-sequential search strategies under constraints on the tests”, Discrete Applied Mathematics, vol. 156, 2008, pp. 1431-1443.
    PUB | DOI | WoS
     
  • [194]
    2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587881
    R. Ahlswede, “Special issue: General theory of information transfer and combinatorics - Preface”, Discrete Applied Mathematics, vol. 156, 2008, pp. 1343-1344.
    PUB | DOI | WoS
     
  • [193]
    2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587893
    R. Ahlswede, F. Cicalese, and C. Deppe, “Searching with lies under error cost constraints”, Discrete Applied Mathematics, vol. 156, 2008, pp. 1444-1460.
    PUB | DOI | WoS
     
  • [192]
    2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587887
    R. Ahlswede, “General theory of information transfer: Updated”, Discrete Applied Mathematics, vol. 156, 2008, pp. 1348-1388.
    PUB | DOI | WoS
     
  • [191]
    2007 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1592060
    R. Ahlswede, “The final form of Tao's inequality relating conditional expectation and conditional mutual information”, ADVANCES IN MATHEMATICS OF COMMUNICATIONS, vol. 1, 2007, pp. 239-242.
    PUB | DOI | WoS
     
  • [190]
    2007 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1595873
    R. Ahlswede and V. Blinovsky, “Classical capacity of classical-quantum arbitrarily varying channels”, IEEE Transactions on Information Theory, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 53, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2007, pp.526-533.
    PUB | DOI | WoS
     
  • [189]
    2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1599920
    R. Ahlswede, H. Aydinian, and L.H. Khachatrian, “Intersection theorems under dimension constraints”, Journal of Combinatorial Theory, Series A, vol. 113, 2006, pp. 483-519.
    PUB | DOI | WoS
     
  • [188]
    2006 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2449061
    R. Ahlswede, et al., eds., General theory of information transfer and combinatorics, Lecture notes in computer science, vol. 4123, Berlin: Springer, 2006.
    PUB
     
  • [187]
    2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1597070
    R. Ahlswede and H. Aydinian, “Construction of asymmetric connectors of depth two”, Journal of Combinatorial Theory. Series A, vol. 113, 2006, pp. 1614-1620.
    PUB | DOI | WoS
     
  • [186]
    2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1598126
    R. Ahlswede and N. Cai, “An interpretation of identification entropy”, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 52, 2006, pp. 4198-4207.
    PUB | DOI | WoS
     
  • [185]
    2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1597073
    R. Ahlswede and V. Blinovsky, “Maximal sets of numbers not containing k+1 pairwise coprimes and having divisors from a specified set of primes”, JOURNAL OF COMBINATORIAL THEORY SERIES A, vol. 113, 2006, pp. 1621-1628.
    PUB | DOI | WoS
     
  • [184]
    2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656516
    R. Ahlswede, et al., “Information Theoretic Models in Language Evolution”, General Theory of Information Transfer and Combinatorics, R. Ahlswede, et al., eds., Lecture Notes in Computer Science, vol. 4123, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp.769-787.
    PUB | DOI
     
  • [183]
    2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656503
    R. Ahlswede, et al., “A Fast Suffix-Sorting Algorithm”, General Theory of Information Transfer and Combinatorics, R. Ahlswede, et al., eds., Lecture Notes in Computer Science, vol. 4123, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp.719-734.
    PUB | DOI
     
  • [182]
    2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1602477
    R. Ahlswede, H. Aydinian, and L.H. Khachatrian, “Forbidden (0,1)-vectors in hyperplanes of R-n: The unrestricted case”, Designs, Codes and Cryptography, vol. 37, 2005, pp. 151-167.
    PUB | DOI | WoS
     
  • [181]
    2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1605326
    R. Ahlswede and L.H. Khachatrian, “Katona's intersection theorem: Four proofs”, COMBINATORICA, vol. 25, 2005, pp. 105-110.
    PUB | WoS
     
  • [180]
    2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2308668
    R. Ahlswede, F. Cicalese, and C. Deppe, “Searching with lies under error transition cost constraints”, Electronic Notes in Discrete Mathematics, vol. 21, 2005, pp. 173-179.
    PUB | DOI
     
  • [179]
    2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1596231
    R. Ahlswede and V. Blinovsky, “On the number of step functions with restrictions”, THEORY OF PROBABILITY AND ITS APPLICATIONS, vol. 50, 2005, pp. 537-560.
    PUB | DOI | WoS
     
  • [178]
    2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913091
    R. Ahlswede, C. Deppe, and V. Lebedev, “Non-binary error correcting codes with noiseless feedback, localized errors, or both”, Annals of the European Academy of Sciences, vol. 1, 2005, pp. 285-309.
    PUB
     
  • [177]
    2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1606261
    R. Ahlswede, H. Aydinian, and L.H. Khachatrian, “On shadows of intersecting families”, Combinatorica, vol. 24, 2004, pp. 555-566.
    PUB | DOI | WoS
     
  • [176]
    2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1608584
    R. Ahlswede, H. Aydinian, and L.H. Khachatrian, “Bohman's conjecture related to a sum packing problem of Erdos”, PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, vol. 132, 2004, pp. 1257-1266.
    PUB | DOI | WoS
     
  • [175]
    2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1607764
    R. Ahlswede and N. Cai, “On lossless quantum data compression with a classical helper”, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 50, 2004, pp. 1208-1219.
    PUB | DOI | WoS
     
  • [174]
    2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1605457
    R. Ahlswede, L.H. Khachatrian, and A. Sarközy, “On the density of primitive sets”, JOURNAL OF NUMBER THEORY, vol. 109, 2004, pp. 319-361.
    PUB | DOI | WoS
     
  • [173]
    2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1611107
    R. Ahlswede, H. Aydinian, and L.H. Khachatrian, “More about shifting techniques”, European Journal of Combinatorics, vol. 24, 2003, pp. 551-556.
    PUB | DOI | WoS
     
  • [172]
    2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1610768
    R. Ahlswede, H. Aydinian, and L.H. Khachatrian, “Maximum number of constant weight vertices of the unit n-cube contained in a k-dimensional subspace”, Combinatorica, Combinatorica, vol. 23, SPRINGER-VERLAG, 2003, pp.5-22.
    PUB | DOI | WoS
     
  • [171]
    2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1609595
    R. Ahlswede, H. Aydinian, and L.H. Khachatrian, “Maximal antichains under dimension constraints”, Discrete Mathematics, Discrete Mathematics, vol. 273, ELSEVIER SCIENCE BV, 2003, pp.23-29.
    PUB | DOI | WoS
     
  • [170]
    2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1609590
    R. Ahlswede, H. Aydinian, and L.H. Khachatrian, “Extremal problems under dimension constraints”, Discrete Mathematics, Discrete Mathematics, vol. 273, ELSEVIER SCIENCE BV, 2003, pp.9-21.
    PUB | DOI | WoS
     
  • [169]
    2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1611224
    R. Ahlswede and L.H. Khachatrian, “Cone dependence - A basic combinatorial concept”, Designs, Codes and Cryptography, Designs, Codes and Cryptography, vol. 29, KLUWER ACADEMIC PUBL, 2003, pp.29-40.
    PUB | DOI | WoS
     
  • [168]
    2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1611220
    R. Ahlswede, H. Aydinian, and L.H. Khachatrian, “Forbidden (0,1)-vectors in hyperplanes of R-n: The restricted case”, Designs, Codes and Cryptography, vol. 29, 2003, pp. 17-28.
    PUB | DOI | WoS
     
  • [167]
    2003 | Zeitschriftenaufsatz | PUB-ID: 1882110
    A. Winter and R. Ahlswede, “Addendum to: "Strong converse for identification via quantum channels"”, IEEE Trans. Inform. Theory, vol. 49, 2003, pp. 346-346.
    PUB
     
  • [166]
    2003 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1878790
    R. Ahlswede and N. Cai, “On lossless quantum data compression and quantum variable-length codes”, Quantum Information Processing, G. Leuchs and T. Beth, eds., Weinheim: Wiley-VCH, 2003, pp.66-78.
    PUB
     
  • [165]
    2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913390
    R. Ahlswede, et al., “A complexity measure for families of binary sequences”, Periodica Mathematica Hungarica, vol. 46, 2003, pp. 107-118.
    PUB
     
  • [164]
    2003 | Zeitschriftenaufsatz | PUB-ID: 1913395
    R. Ahlswede and V. Blinovski, “Large deviations in quantum information theory”, Problems of Information Transmission, vol. 39, 2003, pp. 373-379.
    PUB
     
  • [163]
    2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1614890
    R. Ahlswede, B. Balkenhol, and N. Cai, “Parallel error correcting codes”, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 48, 2002, pp. 959-962.
    PUB | DOI | WoS
     
  • [162]
    2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1614063
    R. Ahlswede and N. Cai, “Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback”, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 48, 2002, pp. 2153-2162.
    PUB | DOI | WoS
     
  • [161]
    2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1613448
    R. Ahlswede, et al., “The t-intersection problem in the truncated boolean lattice”, EUROPEAN JOURNAL OF COMBINATORICS, vol. 23, 2002, pp. 471-487.
    PUB | DOI | WoS
     
  • [160]
    2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1878792
    R. Ahlswede, H. Aydinian, and L. Khachatrian, “Unidirectional error control codes and related combinatorial problems”, Proceedings of Eight International Workshop on Algebraic and Combinatorial Coding Theory, vol. 2002, 2002, pp. 6-9.
    PUB
     
  • [159]
    2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1615280
    R. Ahlswede and A. Winter, “Strong converse for identification via quantum channels”, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 48, 2002, pp. 569-579.
    PUB | DOI | WoS
     
  • [158]
    2001 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883908
    R. Ahlswede, H. Aydinian, and L.H. Khachatrian, “On perfect codes and related concepts”, Designs, Codes and Cryptography, vol. 22, 2001, pp. 221-237.
    PUB | DOI | WoS
     
  • [157]
    2001 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883911
    R. Ahlswede, L. Khachatrian, and A. Sarközy, “On primitive sets of squarefree integers”, Periodica Mathematica Hungarica, vol. 42, 2001, pp. 99-115.
    PUB | DOI
     
  • [156]
    2001 | Sammelwerksbeitrag | PUB-ID: 1883914
    R. Ahlswede, “Advances on extremal problems in number theory and combinatorics”, European Congress of Mathematics : Barcelona, July 10 - 14, 2000, C. Casacuberta, ed., Progress in Mathematics, vol. 201, Basel: Birkhäuser, 2001, pp.147-175.
    PUB
     
  • [155]
    2001 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1617846
    R. Ahlswede and P. Lober, “Quantum data processing”, IEEE Transactions on Information Theory, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 47, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2001, pp.474-478.
    PUB | DOI | WoS
     
  • [154]
    2001 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883973
    R. Ahlswede, N. Cai, and C. Deppe, “An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protection”, Problems of Information Transmission, vol. 37, 2001, pp. 332-338.
    PUB | DOI
     
  • [153]
    2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1883897
    R. Ahlswede, L.H. Khachatrian, and A. Sárközy, “On prefix-free and suffix-free sequences of integers”, Numbers, Information and Complexity, I. Althöfer, et al., eds., Boston: Kluwer Acad. Pub., 2000, pp.1-16.
    PUB
     
  • [152]
    2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1883900
    R. Ahlswede and N. Cai, “The AVC with noiseless feedback”, Numbers, Information and Complexity, I. Althöfer, et al., eds., Boston: Kluwer Academic, 2000, pp.151-176.
    PUB
     
  • [151]
    2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1618855
    R. Ahlswede and L. Khachatrian, “A diametric theorem for edges”, JOURNAL OF COMBINATORIAL THEORY SERIES A, vol. 92, 2000, pp. 1-16.
    PUB | WoS
     
  • [150]
    2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1883895
    R. Ahlswede and L.H. Khachatrian, “Splitting properties in partially ordered sets and set systems”, Numbers, Information and Complexity, I. Althöfer, et al., eds., Boston: Kluwer Acad. Pub., 2000, pp.29-44.
    PUB
     
  • [149]
    2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1619489
    R. Ahlswede, et al., “Network information flow”, IEEE Transactions on Information Theory, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 46, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2000, pp.1204-1216.
    PUB | DOI | WoS
     
  • [148]
    1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1620439
    R. Ahlswede, L.H. Khachatrian, and A. Sarközy, “On the quotient sequence of sequences of integers”, Acta Arithmetica, vol. 91, 1999, pp. 117-132.
    PUB | WoS
     
  • [147]
    1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1621019
    R. Ahlswede, L.H. Khachatrian, and A. Sarközy, “On the counting function of primitive sets of integers”, Journal of Number Theory, vol. 79, 1999, pp. 330-344.
    PUB | DOI | WoS
     
  • [146]
    1999 | Zeitschriftenaufsatz | PUB-ID: 1883870
    R. Ahlswede and V. Balakirsky, “Construction of uniquely decodable codes for the two-user binary adder channel”, IEEE Trans. Inf. Theory, vol. 45, 1999, pp. 326-330.
    PUB | DOI | WoS
     
  • [145]
    1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1623402
    R. Ahlswede and N. Cai, “Arbitrarily varying multiple-access channels - Part I - Ericson's symmetrizability is adequate, Gubner's conjecture is true”, IEEE Transactions on Information Theory, vol. 45, 1999, pp. 742-749.
    PUB | DOI | WoS
     
  • [144]
    1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1621975
    R. Ahlswede and N. Cai, “A counterexample to Kleitman's conjecture concerning an edge-isoperimetric problem”, Combinatorics, Probability and Computing, vol. 8, 1999, pp. 301-305.
    PUB | DOI | WoS
     
  • [143]
    1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883892
    L. Bassalygo, M. Pinsker, and R. Ahlswede, “On the Hamming bound for nonbinary localized-error-correcting codes”, Probl. of Inf. Transmission, vol. 35, 1999, pp. 117-124.
    PUB
     
  • [142]
    1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1621563
    R. Ahlswede and N. Cai, “Identification without randomization”, IEEE Transactions on Information Theory, vol. 45, 1999, pp. 2636-2642.
    PUB | DOI | WoS
     
  • [141]
    1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1623405
    R. Ahlswede and N. Cai, “Arbitrarily varying multiple-access channels - Part II: Correlated senders' side information, correlated messages, and ambiguous transmission”, IEEE Transactions on Information Theory, vol. 45, 1999, pp. 749-756.
    PUB | DOI | WoS
     
  • [140]
    1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1622320
    R. Ahlswede and Z. Zhang, “On maximal shadows of members in left-compressed sets”, Discrete Applied Mathematics, vol. 95, 1999, pp. 3-9.
    PUB | DOI | WoS
     
  • [139]
    1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883876
    R. Ahlswede and L. Khachatrian, “A pushing-pulling method: new proofs of intersection theorems”, Combinatorica, vol. 19, 1999, pp. 1-15.
    PUB | DOI | WoS
     
  • [138]
    1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1913368
    R. Ahlswede and Z. Zhang, “Asymptotical isoperimetric problem”, Presented at the Proceedings 1999 IEEE ITW, Krüger National Park, South Africa, 1999.
    PUB
     
  • [137]
    1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1913370
    R. Ahlswede, L.A. Bassalygo, and M.S. Pinsker, “Nonstandard coding method for nonbinary codes correcting localized errors”, Presented at the Proceedings 1999 IEEE ITW, Krüger National Park, South Africa, 1999.
    PUB
     
  • [136]
    1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1625316
    R. Ahlswede and Z. Zhang, “Code pairs with specified parity of the Hamming distances”, DISCRETE MATHEMATICS, vol. 188, 1998, pp. 1-11.
    PUB | DOI | WoS
     
  • [135]
    1998 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1626601
    R. Ahlswede and I. Csiszar, “Common randomness in information theory and cryptography - Part II: CR capacity”, IEEE Transactions on Information Theory, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 44, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 1998, pp.225-240.
    PUB | DOI | WoS
     
  • [134]
    1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1626351
    R. Ahlswede and N. Cai, “Information and control: Matching channels”, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 44, 1998, pp. 542-563.
    PUB | DOI | WoS
     
  • [133]
    1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1624985
    R. Ahlswede and N. Cai, “Isoperimetric theorems in the binary sequences of finite lengths”, APPLIED MATHEMATICS LETTERS, vol. 11, 1998, pp. 121-126.
    PUB | DOI | WoS
     
  • [132]
    1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1625787
    R. Ahlswede and L.H. Khachatrian, “The diametric theorem in Hamming spaces - Optimal anticodes”, ADVANCES IN APPLIED MATHEMATICS, vol. 20, 1998, pp. 429-449.
    PUB | DOI | WoS
     
  • [131]
    1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1625772
    R. Ahlswede, N. Cai, and Z. Zhang, “Zero-error capacity for models with memory and the enlightened dictator channel”, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 44, 1998, pp. 1250-1252.
    PUB | DOI | WoS
     
  • [130]
    1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1624907
    R. Ahlswede, H. Aydinian, and L. Khachatrian, “The intersection theorem for direct products”, European Journal of Combinatorics, vol. 19, 1998, pp. 649-661.
    PUB | DOI | WoS
     
  • [129]
    1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1627492
    R. Ahlswede and N. Cai, “Shadows and isoperimetry under the sequence-subsequence relation”, Combinatorica, vol. 17, 1997, pp. 11-29.
    PUB | DOI | WoS
     
  • [128]
    1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1636801
    R. Ahlswede and N. Cai, “Correlated sources help transmission over an arbitrarily varying channel”, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 43, 1997, pp. 1254-1255.
    PUB | DOI | WoS
     
  • [127]
    1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1627477
    R. Ahlswede and L.H. Khachatrian, “Counterexample to the Frankl-Pach conjecture for uniform, dense families”, COMBINATORICA, vol. 17, 1997, pp. 299-301.
    PUB | DOI | WoS
     
  • [126]
    1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1637377
    R. Ahlswede and N. Cai, “Edge-isoperimetric inequalities .1. Information-theoretical methods”, EUROPEAN JOURNAL OF COMBINATORICS, vol. 18, 1997, pp. 355-372.
    PUB | DOI | WoS
     
  • [125]
    1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1636745
    R. Ahlswede and N. Cai, “General edge-isoperimetric inequalities .2. A local-global principle for lexicographical solutions”, EUROPEAN JOURNAL OF COMBINATORICS, vol. 18, 1997, pp. 479-489.
    PUB | DOI | WoS
     
  • [124]
    1997 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1628236
    R. Ahlswede, E.-H. Yang, and Z. Zhang, “Identification via compressed data”, IEEE Transactions on Information Theory, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 43, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 1997, pp.48-70.
    PUB | DOI | WoS
     
  • [123]
    1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1636775
    R. Ahlswede and N. Cai, “Models of multi-user write-efficient memories and general diametric theorems”, INFORMATION AND COMPUTATION, vol. 135, 1997, pp. 37-67.
    PUB | DOI | WoS
     
  • [122]
    1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1637712
    R. Ahlswede and L.H. Khachatrian, “Number theoretic correlation inequalities for Dirichlet densities”, JOURNAL OF NUMBER THEORY, vol. 63, 1997, pp. 34-46.
    PUB | DOI | WoS
     
  • [121]
    1997 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1628232
    R. Ahlswede, N. Cai, and Z. Zhang, “On interactive communication”, IEEE Transactions on Information Theory, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 43, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 1997, pp.22-37.
    PUB | DOI | WoS
     
  • [120]
    1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1637812
    R. Ahlswede and L.H. Khachatrian, “The complete intersection theorem for systems of finite sets”, EUROPEAN JOURNAL OF COMBINATORICS, vol. 18, 1997, pp. 125-136.
    PUB | DOI | WoS
     
  • [119]
    1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1637805
    R. Ahlswede, T.S. Han, and K. Kobayashi, “Universal coding of integers and unbounded search trees”, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 43, 1997, pp. 669-682.
    PUB | DOI | WoS
     
  • [118]
    1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1628669
    R. Ahlswede and L.H. Khachatrian, “A counterexample to Aharoni's strongly maximal matching conjecture”, DISCRETE MATHEMATICS, vol. 149, 1996, pp. 289.
    PUB | DOI | WoS
     
  • [117]
    1996 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1913322
    R. Ahlswede and N. Cai, “Cross-disjoint pairs of clouds in the interval lattice”, The Mathematics of Paul Erdos, Vol. I, R.L. Graham and J. Nesetril, eds., Berlin/Heidelberg/New York: Springer Verlag, 1996, pp.155-164.
    PUB
     
  • [116]
    1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1628906
    R. Ahlswede, N. Cai, and Z. Zhang, “Erasure, list, and detection zero-error capacities for low noise and a relation to identification”, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 42, 1996, pp. 55-62.
    PUB | DOI | WoS
     
  • [115]
    1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1638929
    R. Ahlswede, et al., “Fault-tolerant minimum broadcast networks”, NETWORKS, vol. 27, 1996, pp. 293-307.
    PUB | DOI | WoS
     
  • [114]
    1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1638192
    R. Ahlswede and N. Cai, “Incomparability and intersection properties of Boolean interval lattices and chain posets”, EUROPEAN JOURNAL OF COMBINATORICS, vol. 17, 1996, pp. 677-687.
    PUB | DOI | WoS
     
  • [113]
    1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1639105
    R. Ahlswede and L.H. Khachatrian, “Optimal pairs of incomparable clouds in multisets”, GRAPHS AND COMBINATORICS, vol. 12, 1996, pp. 97-137.
    PUB | DOI | WoS
     
  • [112]
    1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1639674
    R. Ahlswede and L.H. Khachatrian, “Sets of integers and quasi-integers with pairwise common divisor”, ACTA ARITHMETICA, vol. 74, 1996, pp. 141-153.
    PUB | WoS
     
  • [111]
    1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1639022
    R. Ahlswede and L.H. Khachatrian, “Sets of integers with pairwise common divisor and a factor from a specified set of primes”, ACTA ARITHMETICA, vol. 75, 1996, pp. 259-276.
    PUB | WoS
     
  • [110]
    1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1638542
    R. Ahlswede and L.H. Khachatrian, “The complete nontrivial-intersection theorem for systems of finite sets”, JOURNAL OF COMBINATORIAL THEORY SERIES A, vol. 76, 1996, pp. 121-138.
    PUB | DOI | WoS
     
  • [109]
    1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913328
    R. Ahlswede and V. Balakirsky, “Identification under random processes”, Problems of Information Transmission, vol. 32, 1996, pp. 123-138.
    PUB
     
  • [108]
    1996 | Preprint | Veröffentlicht | PUB-ID: 1913331
    R. Ahlswede, “Report on work in progress in combinatorial extremal theory: Shadows, AZ-identity, matching”, Ergänzungsreihe des SFB 343 ``Diskrete Strukturen in der Mathematik'', vol. 95-004, 1996.
    PUB
     
  • [107]
    1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913343
    R. Ahlswede, et al., “Intersecting Systems”, Combinatorics, Probability and Computing, vol. 6, 1996, pp. 127-137.
    PUB
     
  • [106]
    1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913355
    R. Ahlswede, N. Cai, and Z. Zhang, “Higher level extremal problems”, Comb. Inf. & Syst. Sc., vol. 21, 1996, pp. 185-210.
    PUB
     
  • [105]
    1996 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1913333
    R. Ahlswede and L. Khachatrian, “Classical results on primitive and recent results on cross-primitive sequences”, The Mathematics of Paul Erdos, Vol. I, R.L. Graham and J. Nesetril, eds., vol. I, Berlin/Heidelberg/New York: Springer Verlag, 1996, pp.104-116.
    PUB
     
  • [104]
    1996 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1913352
    R. Ahlswede, B. Balkenhol, and L. Khachatrian, “Some properties of fix-free codes”, Presented at the Proc. 1st Int. Seminar on Coding Theory and Combinatorics, Thahkadzor, Armenia, Thahkadzor, Armenia: 1996.
    PUB
     
  • [103]
    1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1629125
    R. Ahlswede and L.H. Khachatrian, “Density inequalities for sets of multiples”, JOURNAL OF NUMBER THEORY, vol. 55, 1995, pp. 170-180.
    PUB | DOI | WoS
     
  • [102]
    1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913242
    R. Ahlswede and Z. Zhang, “New directions in the theory of identification via channels”, IEEE Trans. Inf. Theory, vol. 41, 1995, pp. 1040-1050.
    PUB | DOI | WoS
     
  • [101]
    1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913254
    R. Ahlswede and L. Khachatrian, “Maximal sets of numbers not containing k+1 pairwise coprime integers”, Acta Arithmetica, vol. 72, 1995, pp. 77-100.
    PUB | WoS
     
  • [100]
    1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913278
    R. Ahlswede, P.L. Erdős, and N. Graham, “A splitting property of maximal antichains”, Combinatorica, vol. 15, 1995, pp. 475-480.
    PUB | DOI | WoS
     
  • [99]
    1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780563 OA
    R. Ahlswede, L.A. Bassalygo, and M.S. Pinsker, “Asymptotically optimal binary codes of polynomial complexity correcting localized errors”, Probl. Peredachi Inf., vol. 31, 1995, pp. 76-83.
    PUB | PDF
     
  • [98]
    1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1641640
    R. Ahlswede, L.A. Bassalygo, and M.S. Pinsker, “Localized random and arbitrary errors in the light of AV channel theory”, IEEE Transactions on Information Theory, vol. 41, 1995, pp. 14-25.
    PUB | DOI | WoS
     
  • [97]
    1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913236
    R. Ahlswede and S.L. Bezrukov, “Edge isoperimetric theorems for integer point arrays”, Applied Mathematics Letters, vol. 8, 1995, pp. 75-80.
    PUB | DOI | WoS
     
  • [96]
    1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913248
    R. Ahlswede and L. Khachatrian, “Towards characterising equality in correlation inequalities”, European J. of Combinatorics, vol. 16, 1995, pp. 315-328.
    PUB | DOI | WoS
     
  • [95]
    1994 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780546 OA
    R. Ahlswede, H.S. Haroutunian, and L.H. Khachatrian, “Messy broadcasting in networks”, Communications and cryptography: two sides of one tapestry, R.E. Blahut, ed., The Kluwer international series in engineering and computer science, vol. 276, Boston [u.a.]: Kluwer, 1994, pp.13-24.
    PUB | PDF
     
  • [94]
    1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774967 OA
    R. Ahlswede and L.H. Khachatrian, “On extremal sets without coprimes”, Acta Arithmetica, vol. 66, 1994, pp. 89-90.
    PUB | PDF | DOI | WoS
     
  • [93]
    1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780530 OA
    R. Ahlswede and L.H. Khachatrian, “The maximal length of cloud-antichains”, Discrete Mathematics, vol. 131, 1994, pp. 9-15.
    PUB | PDF | DOI | WoS
     
  • [92]
    1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780544 OA
    R. Ahlswede and N. Cai, “Two-way communication complexity of sum-type functions for one processor to be informed”, Problems of information transmission, vol. 30, 1994, pp. 3-10.
    PUB | PDF
     
  • [91]
    1994 | Preprint | Veröffentlicht | PUB-ID: 1780556 OA
    R. Ahlswede and N. Cai, “On sets of words with pairwise common letter in different positions”, 1994.
    PUB | PDF
     
  • [90]
    1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781092 OA
    R. Ahlswede, N. Cai, and Z. Zhang, “A new direction in extremal theory”, Journal of combinatorics, information and system sciences, vol. 19, 1994, pp. 269-280.
    PUB | PDF
     
  • [89]
    1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780527 OA
    R. Ahlswede and G. Simonyi, “On the optimal structure of recovering set pairs in lattices: the sandglass conjecture”, Discrete Mathematics, vol. 128, 1994, pp. 389-394.
    PUB | PDF | DOI | WoS
     
  • [88]
    1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780541 OA
    R. Ahlswede and I. Althöfer, “The asymptotic behavior of diameters in the average”, Journal of Combinatorial Theory, Series B, vol. 61, 1994, pp. 167-177.
    PUB | PDF | DOI | WoS
     
  • [87]
    1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780553 OA
    R. Ahlswede, L.A. Bassalygo, and M.S. Pinsker, “Binary constant-weight codes correcting localized errors and defects”, Problems of information transmission, vol. 30, 1994, pp. 102-104.
    PUB | PDF
     
  • [86]
    1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780560 OA
    R. Ahlswede and N. Cai, “On partitioning and packing products with rectangles”, Combinatorics, Probability & Computing, vol. 3, 1994, pp. 429-434.
    PUB | PDF | DOI
     
  • [85]
    1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780497 OA
    R. Ahlswede and N. Cai, “On communication complexity of vector-valued functions”, IEEE transactions on information theory, vol. 40, 1994, pp. 2062-2067.
    PUB | PDF | DOI | WoS
     
  • [84]
    1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780494 OA
    R. Ahlswede and Z. Zhang, “On multiuser write-efficient memories”, IEEE transactions on information theory, vol. 40, 1994, pp. 674-686.
    PUB | PDF | DOI | WoS
     
  • [83]
    1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774963 OA
    R. Ahlswede and N. Cai, “Rank formulas for certain products of matrices”, Applicable Algebra in Engineering, Communication and Computing, vol. 4, 1993, pp. 253-261.
    PUB | PDF | DOI | WoS
     
  • [82]
    1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780491 OA
    R. Ahlswede and I. Csiszár, “Common randomness in information theory and cryptography. Part I: secret sharing”, IEEE transactions on information theory, vol. 39, 1993, pp. 1121-1132.
    PUB | PDF | DOI | WoS
     
  • [81]
    1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780525 OA
    R. Ahlswede and N. Cai, “On extremal set partitions in Cartesian product spaces”, Combinatorics, Probability & Computing, vol. 2, 1993, pp. 211-220.
    PUB | PDF
     
  • [80]
    1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780515 OA
    A. Blokhuis, et al., “Partitioning the n-cube into sets with mutual distance 1”, Applied Mathematics Letters, vol. 6, 1993, pp. 17-19.
    PUB | PDF | DOI | WoS
     
  • [79]
    1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774960 OA
    R. Ahlswede and N. Cai, “A generalization of the AZ identity”, Combinatorica, vol. 13, 1993, pp. 241-247.
    PUB | PDF | DOI | WoS
     
  • [78]
    1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780485 OA
    R. Ahlswede, “The maximal error capacity of arbitrarily varying channels for constant list sizes”, IEEE transactions on information theory, vol. 39, 1993, pp. 1416-1417.
    PUB | PDF | DOI | WoS
     
  • [77]
    1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780512 OA
    R. Ahlswede, L.A. Bassalygo, and M.S. Pinsker, “Asymptotically dense nonbinary codes correcting a constant number of localized errors [Manuskript]”, Comptes rendus de l' Académie bulgare des Sciences, vol. 46, 1993, pp. 35-37.
    PUB | PDF
     
  • [76]
    1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780487 OA
    R. Ahlswede, L.A. Bassalygo, and M.S. Pinsker, “Nonbinary codes correcting localized errors”, IEEE transactions on information theory, vol. 39, 1993, pp. 1413-1416.
    PUB | PDF | DOI | WoS
     
  • [75]
    1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780521 OA
    R. Ahlswede, N. Cai, and U. Tamm, “Communication complexity in lattices”, Applied Mathematics Letters, vol. 6, 1993, pp. 53-58.
    PUB | PDF | DOI | WoS
     
  • [74]
    1992 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780509 OA
    R. Ahlswede, N. Cai, and Z. Zhang, “Rich colorings with local constraints”, Journal of combinatorics, information & system sciences, vol. 17, 1992, pp. 203-216.
    PUB | PDF
     
  • [73]
    1992 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774877 OA
    R. Ahlswede, N. Cai, and Z. Zhang, “Diametric theorems in sequence spaces”, Combinatorica, vol. 12, 1992, pp. 1-17.
    PUB | PDF | DOI | WoS
     
  • [72]
    1991 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780477 OA
    R. Ahlswede and G. Simonyi, “Reuseable memories in the light of the old arbitrarily varying and a new outputwise varying channel theory”, IEEE transactions on information theory, vol. 37, 1991, pp. 1143-1150.
    PUB | PDF | DOI | WoS
     
  • [71]
    1991 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780480 OA
    R. Ahlswede and B. Verboven, “On identification via multiway channels with feedback”, IEEE transactions on information theory, vol. 37, 1991, pp. 1519-1526.
    PUB | PDF | DOI | WoS
     
  • [70]
    1991 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780482 OA
    R. Ahlswede and N. Cai, “Two proofs of Pinsker's conjecture concerning arbitrarily varying channels”, IEEE transactions on information theory, vol. 37, 1991, pp. 1647-1649.
    PUB | PDF | DOI | WoS
     
  • [69]
    1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775120 OA
    R. Ahlswede and Z. Zhang, “On cloud-antichains and related configurations”, Discrete Mathematics, vol. 85, 1990, pp. 225-245.
    PUB | PDF | DOI | WoS
     
  • [68]
    1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781090 OA
    R. Ahlswede and M.V. Burnashev, “On minimax estimation in the presence of side information about remote data”, The annals of statistics, vol. 18, 1990, pp. 141-171.
    PUB | PDF | DOI | WoS
     
  • [67]
    1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775117 OA
    R. Ahlswede, J.-P. Ye, and Z. Zhang, “Creating order in sequence spaces with simple machines”, Information and Computation, vol. 89, 1990, pp. 47-94.
    PUB | PDF | DOI | WoS
     
  • [66]
    1990 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780506 OA
    R. Ahlswede, N. Cai, and Z. Zhang, “A recursive bound for the number of complete K-subgraphs of a graph”, Topics in combinatorics and graph theory: essays in honour of Gerhard Ringel, R. Bodendiek and R. Henn, eds., Heidelberg: Physica-Verl., 1990, pp.37-39.
    PUB | PDF
     
  • [65]
    1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780503 OA
    R. Ahlswede and Z. Zhang, “An identity in combinatorial extremal theory”, Advances in Mathematics, vol. 80, 1990, pp. 137-151.
    PUB | PDF | DOI | WoS
     
  • [64]
    1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780475 OA
    R. Ahlswede, “Extremal properties of rate distortion functions”, IEEE transactions on information theory, vol. 36, 1990, pp. 166-171.
    PUB | PDF | DOI | WoS
     
  • [63]
    1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775113 OA
    R. Ahlswede and Z. Zhang, “Contributions to a theory of ordering for sequence spaces”, Problems of Control and Information Theory, vol. 18, 1989, pp. 197-221.
    PUB | PDF | WoS
     
  • [62]
    1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780472 OA
    R. Ahlswede and G. Dueck, “Identification in the presence of feedback: a discovery of new capacity formulas”, IEEE transactions on information theory, vol. 35, 1989, pp. 30-36.
    PUB | PDF | DOI | WoS
     
  • [61]
    1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780469 OA
    R. Ahlswede and G. Dueck, “Identification via channels”, IEEE transactions on information theory, vol. 35, 1989, pp. 15-29.
    PUB | PDF | DOI | WoS
     
  • [60]
    1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775115 OA
    R. Ahlswede and Z. Zhang, “Coding for write-efficient memory”, Information and Computation, vol. 83, 1989, pp. 80-97.
    PUB | PDF | DOI | WoS
     
  • [59]
    1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780500 OA
    R. Ahlswede, N. Cai, and Z. Zhang, “A general 4-words inequality with consequences for 2-way communication complexity”, Advances in Applied Mathematics, vol. 10, 1989, pp. 75-94.
    PUB | PDF | DOI | WoS
     
  • [58]
    1988 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775111 OA
    R. Ahlswede and M. Mörs, “Inequalities for code pairs”, European Journal of Combinatorics, vol. 9, 1988, pp. 175-181.
    PUB | PDF | DOI | WoS
     
  • [57]
    1987 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780468 OA
    R. Ahlswede, “On code pairs with specified Hamming distances”, Combinatorics, Colloquia mathematica Societatis János Bolyai, vol. 52, Amsterdam [u.a.]: North Holland Publ. Co. [u.a.], 1987, pp.9-47.
    PUB | PDF
     
  • [56]
    1987 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780605 OA
    R. Ahlswede, “Eight problems in information theory”, Open problems in communication and computation, T.M. Cover, ed., New York [u.a.]: Springer, 1987, pp.39-42.
    PUB | PDF
     
  • [55]
    1987 | Monographie | Veröffentlicht | PUB-ID: 1913125
    R. Ahlswede and I. Wegener, Search Problems, Wiley Interscience Series in Discrete Mathematics, Chichester : John Wiley & Sons Inc, 1987.
    PUB
     
  • [54]
    1987 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780452 OA
    R. Ahlswede and A.H. Kaspi, “Optimal coding strategies for certain permuting channels”, IEEE transactions on information theory, vol. 33, 1987, pp. 310-314.
    PUB | PDF | DOI | WoS
     
  • [53]
    1986 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780427 OA
    R. Ahlswede and I. Csiszár, “Hypothesis testing with communication constraints”, IEEE transactions on information theory, vol. 32, 1986, pp. 533-542.
    PUB | PDF | DOI | WoS
     
  • [52]
    1986 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780441 OA
    R. Ahlswede, “Arbitrarily varying channels with states sequence known to the sender”, IEEE transactions on information theory, vol. 32, 1986, pp. 621-629.
    PUB | PDF | DOI | WoS
     
  • [51]
    1986 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780429 OA
    R. Ahlswede, “On multiple descriptions and team guessing”, IEEE transactions on information theory, vol. 32, 1986, pp. 543-549.
    PUB | PDF | DOI | WoS
     
  • [50]
    1985 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780426 OA
    R. Ahlswede, “The rate-distortion region for multiple descriptions without excess rate”, IEEE transactions on information theory, vol. 31, 1985, pp. 721-726.
    PUB | PDF | DOI | WoS
     
  • [49]
    1984 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775096 OA
    R. Ahlswede, A. El Gamal, and K.F. Pang, “A two-family extremal problem in hamming space”, Discrete Mathematics, vol. 49, 1984, pp. 1-5.
    PUB | PDF | DOI | WoS
     
  • [48]
    1984 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780416 OA
    R. Ahlswede, “Improvements of Winograd's result on computation in the presence of noise”, IEEE transactions on information theory, vol. 30, 1984, pp. 872-877.
    PUB | PDF | DOI | WoS
     
  • [47]
    1983 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775100 OA
    R. Ahlswede and K.U. Koschnick, “Note on an extremal problem arising for unreliable networks in parallel computing”, Discrete Mathematics, vol. 47, 1983, pp. 137-152.
    PUB | PDF | DOI | WoS
     
  • [46]
    1983 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780414 OA
    R. Ahlswede and T.S. Han, “On source coding with side information via a multiple-access channel and related problems in multi-user information theory”, IEEE transactions on information theory, vol. 29, 1983, pp. 396-412.
    PUB | PDF | DOI | WoS
     
  • [45]
    1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913152 OA
    R. Ahlswede, “An elementary proof of the strong converse theorem for the multiple-access channel”, J. Combinatorics, Information and System Sciences, vol. 7, 1982, pp. 216-230.
    PUB | PDF
     
  • [44]
    1982 | Monographie | Veröffentlicht | PUB-ID: 1913139
    R. Ahlswede and I. Wegener, Zadaci poiska, Moskau: MIR-Verlag, 1982.
    PUB
     
  • [43]
    1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775489 OA
    R. Ahlswede, “Remarks on Shannon's secrecy systems”, Problems of Control and Information Theory, vol. 11, 1982, pp. 301-318.
    PUB | PDF
     
  • [42]
    1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775509 OA
    R. Ahlswede and G. Dueck, “Bad codes are good ciphers”, Problems of Control and Information Theory, vol. 11, 1982, pp. 337-351.
    PUB | PDF
     
  • [41]
    1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780388 OA
    R. Ahlswede, “Jacob Wolfowitz (1910-1981)”, IEEE transactions on information theory, vol. 28, 1982, pp. 687-690.
    PUB | PDF
     
  • [40]
    1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1776125 OA
    R. Ahlswede and G. Dueck, “Good codes can be produced by a few permutations”, IEEE transactions on information theory, vol. 28, 1982, pp. 430-443.
    PUB | PDF | DOI | WoS
     
  • [39]
    1981 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775487 OA
    R. Ahlswede and I. Csiszár, “To get a bit of information may be as hard as to get full information”, IEEE transactions on information theory, vol. 27, 1981, pp. 398-408.
    PUB | PDF | DOI | WoS
     
  • [38]
    1980 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780400 OA
    R. Ahlswede, “Simple hypergraphs with maximal number of adjacent pairs of edges”, Journal of Combinatorial Theory, Series B, vol. 28, 1980, pp. 164-167.
    PUB | PDF | DOI | WoS
     
  • [37]
    1980 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775420 OA
    R. Ahlswede, “Coloring hypergraphs: A new approach to multi-user source coding, 2”, Journal of combinatorics, information & system sciences, vol. 5, 1980, pp. 220-268.
    PUB | PDF
     
  • [36]
    1980 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775486 OA
    R. Ahlswede, “A method of coding and its application to arbitrarily varying channels”, Journal of combinatorics, information and system sciences, vol. 5, 1980, pp. 10-35.
    PUB | PDF
     
  • [35]
    1979 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774874 OA
    R. Ahlswede and D.E. Daykin, “Inequalities for a pair of maps S x S -> S with S a finite set”, Mathematische Zeitschrift, vol. 165, 1979, pp. 267-289.
    PUB | PDF | DOI | WoS
     
  • [34]
    1979 | Monographie | Veröffentlicht | PUB-ID: 1913120
    R. Ahlswede and I. Wegener, Suchprobleme, Teubner, 1979.
    PUB
     
  • [33]
    1979 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780382 OA
    R. Ahlswede and D.E. Daykin, “The number of values of combinatorial functions”, Bulletin of the London Mathematical Society, vol. 11, 1979, pp. 49-51.
    PUB | PDF | DOI
     
  • [32]
    1979 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775419 OA
    R. Ahlswede, “Coloring hypergraphs: A new approach to multi-user source coding, 1”, Journal of combinatorics, information & system sciences, vol. 4, 1979, pp. 76-115.
    PUB | PDF
     
  • [31]
    1979 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780389 OA
    R. Ahlswede and D.E. Daykin, “Integral inequalities for increasing functions”, Mathematical Proceedings of the Cambridge Philosophical Society, vol. 86, 1979, pp. 391-394.
    PUB | PDF | DOI | WoS
     
  • [30]
    1978 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774867 OA
    R. Ahlswede, “Elimination of correlation in random codes for arbitrarily varying channels”, Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 44, 1978, pp. 159-175.
    PUB | PDF | DOI | WoS
     
  • [29]
    1978 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780385 OA
    R. Ahlswede and G.O.H. Katona, “Graphs with maximal number of adjacent pairs of edges”, Acta mathematica Academiae Scientiarum Hungaricae, vol. 32, 1978, pp. 97-120.
    PUB | PDF | DOI | WoS
     
  • [28]
    1978 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774869 OA
    R. Ahlswede and D.E. Daykin, “An inequality for the weights of two families of sets, their unions and intersections”, Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 43, 1978, pp. 183-185.
    PUB | PDF | DOI | WoS
     
  • [27]
    1977 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775092 OA
    R. Ahlswede and G.O.H. Katona, “Contributions to the geometry of hamming spaces”, Discrete Mathematics, vol. 17, 1977, pp. 1-22.
    PUB | PDF | DOI | WoS
     
  • [26]
    1977 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780380 OA
    R. Ahlswede and J. Körner, “On the connection between the entropies of input and output distributions of discrete memoryless channels”, Proceedings of the fifth Conference on Probability Theory, Bucuresti: Ed. Acad. Republicii Socialiste România, 1977, pp.13-22.
    PUB | PDF
     
  • [25]
    1977 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774860 OA
    R. Ahlswede, P. Gács, and J. Körner, “Correction to: Bounds on conditional probabilities with applications”, Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 39, 1977, pp. 353-354.
    PUB | PDF | DOI | WoS
     
  • [24]
    1976 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781088 OA
    R. Ahlswede and P. Gács, “Spreading of sets in product spaces and hypercontraction of the Markov operator”, The annals of probability, vol. 4, 1976, pp. 925-939.
    PUB | PDF
     
  • [23]
    1976 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774864 OA
    R. Ahlswede and G. Dueck, “Every bad code has a good subcode: a local converse to the coding theorem”, Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 34, 1976, pp. 179-182.
    PUB | PDF | DOI | WoS
     
  • [22]
    1976 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774856 OA
    R. Ahlswede, P. Gács, and J. Körner, “Bounds on conditional probabilities with applications in multi-user communication”, Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol. 34, 1976, pp. 157-177.
    PUB | PDF | DOI | WoS
     
  • [21]
    1975 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1775417 OA
    R. Ahlswede and P. Gács, “Two contributions to information theory”, Topics in information theory, I. Csiszár, ed., Colloquia mathematica Societatis János Bolyai, vol. 16, Amsterdam: North Holland Publ., 1975, pp.17-40.
    PUB | PDF
     
  • [20]
    1975 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775415 OA
    R. Ahlswede and J. Körner, “Source encoding with side information and a converse for degraded broadcast channels”, IEEE transactions on information theory, vol. IT-21, 1975, pp. 629-637.
    PUB | PDF
     
  • [19]
    1975 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775089 OA
    R. Ahlswede and R. Bojanic, “Approximation o continuous functions in p-Adic Analysis”, Journal of Approximation Theory, vol. 15, 1975, pp. 190-205.
    PUB | PDF | DOI | WoS
     
  • [18]
    1974 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781087 OA
    R. Ahlswede, “The capacity region of a channel with two senders and two receivers”, The annals of probability, vol. 2, 1974, pp. 805-814.
    PUB | PDF
     
  • [17]
    1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780371 OA
    R. Ahlswede, “Multi-way communication channels”, Second International Symposium on Information Theory: Tsahkadsor, Armenia, USSR, Sept. 2 - 8, 1971, B.N. Petrov, ed., Budapest: Akadémiai Kiadó, 1973, pp.23-51.
    PUB | PDF
     
  • [16]
    1973 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774854 OA
    R. Ahlswede, “Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback”, Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 25, 1973, pp. 239-252.
    PUB | PDF | DOI | WoS
     
  • [15]
    1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780373 OA
    R. Ahlswede, “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: held at Prague, from September 19 to 25, 1971, J. Kozesník, ed., München: Verl. Dokumentation [u.a.], 1973, pp.39-50.
    PUB | PDF
     
  • [14]
    1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780372 OA
    R. Ahlswede, “On two-way communication channels and a problem by Zarankiewicz”, Transactions of the Sixth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes: held at Prague, from September 19 to 25, 1971, J. Kozesník, ed., München: Verl. Dokumentation [u.a.], 1973, pp.23-37.
    PUB | PDF
     
  • [13]
    1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780374 OA
    R. Ahlswede, “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: held at Prague, from September 19 to 25, 1971, J. Kozesník, ed., München: Verl. Dokumentation [u.a.], 1973, pp.13-21.
    PUB | PDF
     
  • [12]
    1973 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781086 OA
    R. Ahlswede, “Channel capacities for list codes”, Journal of applied probability, vol. 10, 1973, pp. 824-836.
    PUB | PDF
     
  • [11]
    1971 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775343 OA
    R. Ahlswede and J. Wolfowitz, “Channels without synchronization”, Advances in applied probability, vol. 3, 1971, pp. 383-403.
    PUB | PDF
     
  • [10]
    1971 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775381 OA
    R. Ahlswede and J. Gemma, “Bounds on algebraic code capacities for noisy channels. II”, Information and Control, vol. 19, 1971, pp. 146-158.
    PUB | PDF | DOI | WoS
     
  • [9]
    1971 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774872 OA
    R. Ahlswede, “Group Codes do not Achieve Shannon's Channel Capacity for General Discrete Channels”, The Annals of Mathematical Statistics, vol. 42, 1971, pp. 224-240.
    PUB | PDF | DOI | WoS
     
  • [8]
    1971 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775378 OA
    R. Ahlswede and J. Gemma, “Bounds on algebraic code capacities for noisy channels. I”, Information and Control, vol. 18, 1971, pp. 124-145.
    PUB | PDF | DOI | WoS
     
  • [7]
    1970 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781084 OA
    R. Ahlswede, “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”, The annals of mathematical statistics, vol. 41, 1970, pp. 1027-1033.
    PUB | PDF
     
  • [6]
    1970 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774851 OA
    R. Ahlswede and J. Wolfowitz, “The capacity of a channel with arbitrarily varying channel probability functions and binary output”, Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 15, 1970, pp. 186-194.
    PUB | PDF | DOI | WoS
     
  • [5]
    1969 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775340 OA
    R. Ahlswede and J. Wolfowitz, “Correlated decoding for channels with arbitrarily varying channel probability functions”, Information and Control, vol. 14, 1969, pp. 457-473.
    PUB | PDF | DOI | WoS
     
  • [4]
    1969 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1775145 OA
    R. Ahlswede and J. Wolfowitz, “The structure of capacity functions for compound channels”, Probability and information theory, M. Behara, ed., Lecture notes in mathematics ; 89,1, vol. vol. 1: Proceedings of the international symposium at McMaster University, Canada, April 1968, Berlin: Springer, 1969, pp.12-54.
    PUB | PDF
     
  • [3]
    1968 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774842 OA
    R. Ahlswede, “The weak capacity of averaged channels”, Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 11, 1968, pp. 61-73.
    PUB | PDF | DOI | WoS
     
  • [2]
    1968 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774845 OA
    R. Ahlswede, “Beiträge zur Shannonschen Informationstheorie im Falle nichtstationärer Kanäle”, Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 10, 1968, pp. 1-42.
    PUB | PDF | DOI | WoS
     
  • [1]
    1967 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780342 OA
    R. Ahlswede, “Certain results in coding theory for compound channels”, Proceedings of the Colloquium on Information Theory, A. Rényi, ed., Colloquia mathematica Societatis János Bolyai / Bolyai Janos Matematikai Tarsulat ; 1, Budapest: 1967, pp.35-60.
    PUB | PDF
     
Markierte Publikation(en)

Suche

Publikationen filtern

Darstellung / Sortierung

Export / Einbettung