194 Publications

Mark all

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

Search

Filter Publications

Display / Sort

Export / Embed

194 Data Publications

Mark all

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

Search

Filter Publications

Display / Sort

Export / Embed