Ahlswede, Rudolf 1938-2010
Ahlswede, Rudolf, 1938-....
Ahlswede, Rudolf
Ahlswede, R.
Rudolf Ahlswede
VIAF ID: 109466553 ( Personal )
Permalink: http://viaf.org/viaf/109466553
Preferred Forms
-
- 100 1 _ ‡a Ahlswede, R.
-
-
- 100 1 _ ‡a Ahlswede, Rudolf
-
-
-
- 100 1 _ ‡a Ahlswede, Rudolf ‡d 1938-2010
- 100 1 _ ‡a Ahlswede, Rudolf ‡d 1938-2010
-
- 100 1 0 ‡a Ahlswede, Rudolf, ‡d 1938-
-
-
-
-
- 100 1 _ ‡a Ahlswede, Rudolf, ‡d 1938-....
- 100 0 _ ‡a Rudolf Ahlswede
4xx's: Alternate Name Forms (27)
Works
Title | Sources |
---|---|
Arbitrarily varying multiple access channels | |
Asymptotically optimal binary codes of polynominal complexity correcting localized errors | |
Bad codes are good ciphers submitted in Nov. 1980 to the proceedings of the Internat. Colloquium on Information Theory, to be held at Budapest in August 1981 | |
The best known codes are highly probable and can be produced by a few permutations | |
Code pairs with specified parity of the Hamming distances | |
Common randomness in information theory and cryptography | |
complete intersection theorem for systems of finite sets | |
Correlated sources help the transmission over AVC | |
Counterexample to the Frankl-Pach conjecture for uniform, dense families | |
Density inequalities for sets of multiples | |
diametric theorem in Hamming spaces optimal anticodes | |
Edge isoperimetric theorems for integer point arrays | |
Erasure, list and detection zero-error capacities for low noise and a relation to identification | |
Fault tolerant minimum broadcast networks | |
General edge isoperimetric inequalities | |
General theory of information transfer and combinatorics | |
generalization of the AZ identity | |
Identification under Random processes | |
Identification via compressed data | |
Information and control matching channels | |
Lectures on advances in combinatorics | |
Localized random and arbitrary errors in the light of AV channel theory | |
Maximal number of constant weight vertices of the unit n-cube contained in a k-dimensional subspace | |
Maximal sets of numbers not containing k + 1 pairwise coprime integers | |
Messy broadcasting in networks | |
Models of multi-user write efficient memories and general diametric theorems | |
More about shifting techniques | |
Network information flow: single source | |
New directions in the theory of identification via channels | |
Note on an extremal problem arising for unreliable networks in parallel computing | |
Note on the optimal structure of recovering set pairs in lattices the sandglass conjecture | |
Number theoretic correlation inequalities for Dirichlet densities | |
On common information and related characteristics of correlated information sources | |
On communication complexity of vector valued functions | |
On concepts of performance parameters for channels | |
On extremal sets without coprimes | |
On identification via multi-way channels with feedback | |
On interactive communication | |
On perfect codes and related concepts | |
On POS partitions and hypergraph products | |
On set coverings in cartesian product spaces | |
On sets of words with pairwise common letter in different positions | |
On source coding with side information via a multiple-access channel and related problems to be presented at the IEEE int. symposium, Santa Monica, USA, Febr. 1981 | |
On the counting function of primitive sets of integers | |
On the quotient sequence of sequences of integers | |
Optimal pairs of incomparabele clouds in multisets | |
Parallel error correcting codes | |
Partition of a rectangle into rectangles with restricted partition number of cross sections | |
pushing pulling method new proofs of intersection theorems | |
Quantum data processing | |
Rank formulas for certain products of matrices | |
recursive bound for the number of complete K-subgraphs of a graph | |
Report on models of write efficient memories with localized errors and defects | |
Report on work in progress in combinatorial extremal theory shadows, AZ-identities, matching | |
Rich colorings with local constraints | |
Search problems | |
Semi-noisy deterministic multiple access channels coding theorems for list codes and codes with feedback | |
Sets of integers and quasi-integers with pairwise commen divisor | |
Shadows and isoperimetry under the sequence subsequence relation | |
Sharp bounds for cloud antichains of length two | |
Shift synchronization codes | |
simple proof of the Hook formula by a staircase identity | |
Some properties of fix free codes | |
Splitting properties in partially ordered sets and set systems | |
A splitting property of maximal antichains | |
Strong converse for identification via quantum channels | |
Suchprobleme | |
Symposium "Numbers, Information and Complexity" in Honour of R. Ahlswede [University of Bielefeld, October 8 - 11, 1998] | |
t-intersection problem in the truncated Boolean lattice | |
To get a bit of information may be as hard as to get full information | |
Towards characterising equality in correlation inequalities | |
Transmitting and Gaining Data : Rudolf Ahlswede’s Lectures on Information Theory 2 | |
Universal coding of integers and unboundes search trees | |
Zadači poiska | |
Задачи поиска |