The following pages link to Rudolf Ahlswede (Q267572):
Displayed 50 items.
- Item:Q267572 (redirect page) (← links)
- Hiding data -- selected topics. Rudolf Ahlswede's lectures on information theory 3. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm (Q267574) (← links)
- Finding one of \(D\) defective elements in some group testing models (Q375957) (← links)
- Shadows under the word-subword relation (Q376110) (← links)
- Transmitting and gaining data. Rudolf Ahlswede's lectures on information theory. Vol. 2. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm (Q476423) (← links)
- Combinatorial methods and models. Rudolf Ahlswede's lectures on information theory 4. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm (Q526571) (← links)
- Katona's intersection theorem: four proofs (Q558316) (← links)
- The final form of Tao's inequality relating conditional expectation and conditional mutual information (Q629759) (← links)
- The complete intersection theorem for systems of finite sets (Q674615) (← links)
- Number theoretic correlation inequalities for Dirichlet densities (Q677622) (← links)
- On minimax estimation in the presence of side information about remote data (Q749081) (← links)
- Creating order in sequence spaces with simple machines (Q751622) (← links)
- Coding for channels with localized errors: The non-binary cases (Q752664) (← links)
- On cloud-antichains and related configurations (Q757448) (← links)
- Note on an extremal problem arising for unreliable networks in parallel computing (Q786823) (← links)
- Inequalities for code pairs (Q800361) (← links)
- Construction of asymmetric connectors of depth two (Q855860) (← links)
- Maximal sets of numbers not containing \(k+1\) pairwise coprimes and having divisors from a specified set of primes (Q855861) (← links)
- An identity in combinatorial extremal theory (Q917551) (← links)
- Lectures on advances in combinatorics (Q929393) (← links)
- General theory of information transfer: Updated (Q947076) (← links)
- Ratewise-optimal non-sequential search strategies under constraints on the tests (Q947084) (← links)
- Searching with lies under error cost constraints (Q947085) (← links)
- Multiple packing in sum-type metric spaces (Q947090) (← links)
- A general 4-words inequality with consequences for 2-way communication complexity (Q1118569) (← links)
- Coding for write-efficient memory (Q1123626) (← links)
- Inequalities for a pair of maps \(S\times S\to S\) with \(S\) a finite set (Q1134761) (← links)
- Simple hypergraphs with maximal number of adjacent pairs of edges (Q1142787) (← links)
- The capacity of a channel with two senders and two receivers (Q1222141) (← links)
- Approximation of continuous functions in p-adic analysis (Q1223444) (← links)
- Spreading of sets in product spaces and hypercontraction of the Markov operator (Q1233262) (← links)
- Contributions to the geometry of Hamming spaces (Q1242920) (← links)
- The diametric theorem in Hamming spaces---optimal anticodes (Q1271885) (← links)
- The intersection theorem for direct products (Q1272766) (← links)
- Binary constant-weight codes correcting localized errors and defects (Q1280740) (← links)
- On maximal shadows of members in left-compressed sets (Q1305086) (← links)
- A generalization of the AZ identity (Q1311014) (← links)
- Rank formulas for certain products of matrices (Q1311620) (← links)
- Partitioning the \(n\)-cube into sets with mutual distance 1 (Q1312006) (← links)
- On the optimal structure of recovering set pairs in lattices: The sandglass conjecture (Q1322202) (← links)
- Communication complexity in lattices (Q1324492) (← links)
- The maximal length of cloud-antichains (Q1332440) (← links)
- The asymptotic behaviour of diameters in the average (Q1333337) (← links)
- General edge-isoperimetric inequalities. I: Information-theoretical methods (Q1357262) (← links)
- General edge-isoperimetric inequalities. II: A local-global principle for lexicographical solutions (Q1362991) (← links)
- Models of multi-user write-efficient memories and general diametric theorems (Q1363782) (← links)
- Shadows and isoperimetry under the sequence-subsequence relation (Q1382388) (← links)
- Counterexample to the Frankl-Pach conjecture for uniform, dense families (Q1382415) (← links)
- Identification under random processes (Q1389276) (← links)
- More about shifting techniques (Q1399692) (← links)