Projekt B2
"Modelle mit Informationsaustausch"


Leiter:
Prof. Dr. rer. nat. Rudolf Ahlswede
email: ahlswede@Mathematik.Uni-Bielefeld.DE
Büro: V5-105
Tel.: ++49-521-106-4789
WWW: http://www.mathematik.uni-bielefeld.de/ahlswede/

Mitarbeiter: Doktoranden:
Vladimir Balakirsky email: vbal@Mathematik.Uni-Bielefeld.DE
Büro: U5-151
Tel.: ++49-521-106-3876
WWW: http://www.mathematik.uni-bielefeld.de/~vbal/
Suren Arzumanyan email: sfb29@Mathematik.Uni-Bielefeld.DE
Büro: V3-238
Tel.: ++49-521-106-4968

Bernhard Balkenhol email: bernhard@Mathematik.Uni-Bielefeld.DE
Büro: U5-138
Tel.: ++49-521-106-3861
WWW: http://www.mathematik.uni-bielefeld.de/~bernhard/
Lars Bäumer email: baeumer@Mathematik.Uni-Bielefeld.DE
Büro: U5-151
Tel.: ++49-521-106-3876
WWW: http://www.mathematik.uni-bielefeld.de/~baeumer/
Ning Cai email: cai@Mathematik.Uni-Bielefeld.DE
Büro: V5-109
Tel.: ++49-521-106-4790
WWW: http://www.mathematik.uni-bielefeld.de/~cai/
Christian Kleinewächter email: kleinew@Mathematik.Uni-Bielefeld.DE
Büro: U5-138
Tel.: ++49-521-106-3861
WWW: http://www.mathematik.uni-bielefeld.de/~kleinew/
Peter Löber email: loeber@Mathematik.Uni-Bielefeld.DE
Büro: V3-222
Tel.: ++49-521-106-2978
WWW: http://www.mathematik.uni-bielefeld.de/~loeber/
Andreas Winter email: winter@Mathematik.Uni-Bielefeld.DE
Büro: V3-222
Tel.: ++49-521-106-2978
WWW: http://www.mathematik.uni-bielefeld.de/~winter/


Forschungsschwerpunkte:


Publikationen 1994-97:

94-032   R. Ahlswede, L. Gargano, H. S. Haroutunian, L. H. Khachatrian
         Fault-Tolerant Minimum Broadcast Networks
         NETWORKS 27, No. 4, 293-307(1996)

94-113   Alexei Ashikhmin, Alexander Barg              
         Minimal Vectors in Linear Codes and Sharing of Secrets

94-114   Carlo Blundo, Antonella Cresti,               
         Alfredo De Santis, Ugo Vaccaro
         Fully Dynamic Secret Sharing Schemes
         Theoret. Comput. Sci. 165, No. 2, 407-440 (1996)

94-115   Carlo Blundo, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro
         On the Information Rate of Secret Sharing Schemes
         Theoret. Comput. Sci. 154, No. 2, 283-306 (1996)

94-116   Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno, 
         Ugo Vaccaro
         Fast Gossiping by Short Messages 
         To appear in: SIAM J. Comput.

95-007   Rudolf Ahlswede, Enhui Yang, Zhen Zhang
         Identification via Compressed Data

95-035   Rudolf Ahlswede, Ning Cai
         Information and Control: Matching Channels
         IEEE Trans. Inform. Theory 43, No. 1, 48-70 (1997)

95-051   V. B. Balakirsky                                    
         Hashing of Data Bases Based on Indirect
         Observations of Hamming Distances
         IEEE Trans.Inform.Theory, vol.42, pp.664-671, Mar. 1996

95-098   Rudolf Ahlswede, Vladimir B. Balakirsky
         Identification under Random Processes
         Problemy Peredachi Informatsii vol.32, pp.144-160, 
         Jan.-Mar. 1996 (in Russian)

95-100   V. B. Balakirsky                                    
         A Converse Coding Theorem for Mismatched Decoding
         at the Output of Binary-Input Memoryless Channels
         IEEE Trans.Inform.Theory, vol.41, pp.1889-1902, Nov. 1995

95-101   Rudolf Ahlswede, I. Csiszar
         Common Randomness in Information Theory and
            Cryptography. Part 2: CR Capacity
         To appear in: IEEE Trans. Inform. Theory

95-106   Rudolf Ahlswede, Ning Cai
         Correlated Sources Help the Transmission over AVC 
         To appear in: IEEE Trans. Inform. Theory

95-114   R. Ahlswede, L. H. Khachatrian                         
         Counterexample to the Frankl/Pach Conjecture for
            Uniform, Dense Families 
         To appear in: Combinatorica

E95-003  R. Ahlswede, J. Körner
         On Common Information and Related
            Characteristics of Correlated Information 
            Sources

E95-004  R. Ahlswede, N. Cai, N. Danh, E. Daykin,
         L.H. Khachatrian, T.D. Thu 
         Report on Work in Progress in Combinatorial
            Extremal Theory: Schadows, AZ-Identities, 
            Matching

96-064   Rudolf Ahlswede, Ning Cai
         The AVC with Noiseless Feedback and Maximal
            Error Probability: A Capacity Formula with a Trichotomy

96-068   Rudolf Ahlswede, Ning Cai
         Arbitrarily Varying Multiple-Access Channels,
            Part I: Ericson's Symmetrizability is Adequate,
            Gubner's Conjecture is True

E96-004  D.N. Gevorkian, L.H. Khachatrian, R.K. Oglakchian      
         Contributions to the Diagnosis of Computing Networks

E96-011  Marat V. Burnashev
         Selected Topics of Information Theory and Mathematical Statistics

97-006   Rudolf Ahlswede, Ning Cai
         Arbitrarily Varying Multiple-Access Channels 
            Part II: Correlated Sender's Side Information, 
            Correlated Messages, and Ambiguous Transmission

97-011   R. Ahlswede, N. Cai, Z. Zhang
         Zero-Error Capacity for models with memory and
            the enlightened dictator channel

97-016   Rudolf Ahlswede, Vladimir B. Balakirsky
         Construction of Uniquely Decodable Codes for the
            Two-User Binary Adder Channel

97-026   Rudolf Ahlswede, Zhen Zhang
         An Asymptotic Estimate of Sizes of Left-Compressed Sets

97-034   Rudolf Ahlswede, Ning Cai
         A Counterexample in Rate-Distortion Theory for
            Correlated Sources

97-047   Rudolf Ahlswede, Ning Cai
         Isoperimetric Theorems in the Binary Sequences 
            of Finite Lengths

97-118   Rudolf Ahlswede
         General Theory of Information Transfer

For any questions and problems with this web site please email to cdeppe@Mathematik.Uni-Bielefeld.DE. Last change: 30/11/11998