The following pages link to Rudolf Ahlswede (Q267572):
Displayed 50 items.
- Forbidden (0, 1)-vectors in hyperplanes of \(\mathbb{R}^n\): The restricted case (Q1404309) (← links)
- Cone dependence -- a basic combinatorial concept (Q1404310) (← links)
- Extremal problems under dimension constraints. (Q1417564) (← links)
- Maximal antichains under dimension constraints (Q1417565) (← links)
- On the Hamming bound for nonbinary localized-error-correcting codes (Q1567738) (← links)
- A diametric theorem for edges (Q1586122) (← links)
- Probabilistic methods and distributed information. Rudolf Ahlswede's lectures on information theory 5. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm. With contributions by Vladimir Blinovsky, Holger Boche, Ulrich Krengel an (Q1725954) (← links)
- On the density of primitive sets (Q1764002) (← links)
- Isoperimetric theorems in the binary sequences of finite lengths (Q1808627) (← links)
- An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protection (Q1812392) (← links)
- The \(t\)-intersection problem in the truncated Boolean lattice (Q1864563) (← links)
- Maximum number of constant weight vertices of the unit \(n\)-cube contained in a \(k\)-dimensional subspace (Q1878586) (← links)
- A complexity measure for families of binary sequences (Q1878610) (← links)
- Edge isoperimetric theorems for integer point arrays (Q1893693) (← links)
- Towards characterizing equality in correlation inequalities (Q1896333) (← links)
- Two-way communication complexity of sum-type functions for one processor to be informed (Q1897981) (← links)
- A splitting property of maximal antichains (Q1906844) (← links)
- Density inequalities for sets of multiples (Q1907840) (← links)
- A counterexample to Aharoni's strongly maximal matching conjecture (Q1910586) (← links)
- Optimal pairs of incomparable clouds in multisets (Q1915140) (← links)
- The complete nontrivial-intersection theorem for systems of finite sets (Q1924241) (← links)
- Asymptotically optimal binary codes of polynomial complexity correcting localized errors (Q1925359) (← links)
- Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels (Q1936645) (← links)
- A counterexample in rate-distortion theory for correlated sources (Q1961716) (← links)
- On the counting function of primitive sets of integers. (Q1970612) (← links)
- Intersection theorems under dimension constraints (Q2368655) (← links)
- Large deviations in quantum information theory (Q2388460) (← links)
- Storing and transmitting data. Rudolf Ahlswede's lectures on information theory 1. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm (Q2442137) (← links)
- Incomparability and intersection properties of Boolean interval lattices and chain posets (Q2563521) (← links)
- On shadows of intersecting families (Q2567401) (← links)
- Forbidden \((0,1)\)-vectors in hyperplanes of \(\mathbb R^n\): the unrestricted case (Q2572984) (← links)
- (Q2785576) (← links)
- (Q2785580) (← links)
- (Q3041078) (← links)
- (Q3160306) (← links)
- Improvements of Winograd's result on computation in the presence of noise (Corresp.) (Q3222106) (← links)
- On Security of Statistical Databases (Q3225154) (← links)
- (Q3312146) (← links)
- On source coding with side information via a multiple-access channel and related problems in multi-user information theory (Q3328441) (← links)
- (Q3348931) (← links)
- Reuseable memories in the light of the old arbitrarily varying and a new outputwise varying channel theory (Q3360785) (← links)
- On the Number of Step Functions with Restrictions (Q3429706) (← links)
- Extremal problems under dimension constraints (Q3438973) (← links)
- On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Source with Side Information (Q3439224) (← links)
- Information theoretic models in language evolution (Q3439225) (← links)
- Sparse asymmetric connectors in communication networks (Q3439226) (← links)
- A Fast Suffix-Sorting Algorithm (Q3439227) (← links)
- Identification for Sources (Q3439229) (← links)
- Correlation Inequalities in Function Spaces (Q3439230) (← links)
- Multiple Packing in Sum-type Metric Spaces (Q3439231) (← links)