Rudolf Ahlswede

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

206 Publikationen

Alle markieren

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

Suche

Publikationen filtern

Darstellung / Sortierung

Export / Einbettung