Preprints of the SFB 343

"Diskrete Strukturen in der Mathematik"


89-003   Rudolf Ahlswede, Jian-ping Ye, Zhen Zhang
         Creating order in sequence spaces with simple machines

89-004   R. Ahlswede, C. Cai, Z. Zhang
         Diametric Theorems in Sequence Spaces

89-006   R. Ahlswede
         Extremal properties of rate-distortion functions

89-011   R. Ahlswede, N. Cai, Z. Zhang
         Rich colorings with local constraints

89-012   R. Ahlswede, N. Cai, Z. Zhang
         A recursive bound for the number of complete
         $K$-subgraphs of a graph

89-020   Rudolf Ahlswede
         Coding for channels with localized errors: the non--binary cases

90-010   Rudolf Ahlswede, Ning Cai
         A generalization of the AZ identity

90-011   Rudolf Ahlswede, Bart Verboven
         On identification via multi-way channels with feedback

90-013   Rudolf Ahlswede, Gabor Simonyi
         Reusable memories in the light of the old AV-and a
         new F-channel theory

90-050   Rudolf Ahlswede, Ning Cai
         Two Proofs of Pinker's conjecture concerning AV channels

90-081   R. Ahlswede, I.Csiszar
         The role of common randomness in Information Theory
         and Cryptography, Part I. Secrecy constraints

91-041   Rudolf Ahlswede, Ning Cai
         On Communication Complexity of Vector-valued Functions

91-050   Rudolf Ahlswede, Ning Cai
         On sets of words with pairwise common letter
         in different positions

91-053   Rudolf Ahlswede, Ning Cai
         2-way communication complexity of sum-type functions 
         for one processor to be informed

91-056   R. Ahlswede, L.A. Bassalygo, M.S. Pinsker
         Nonbinary codes correcting localized errors

91-099   Rudolf Ahlswede, Ingo Althöfer
         The Asymptotic Behaviour of Diameters in the Average

91-116   Rudolf Ahlswede, Levon H. Khachatrian
         The maximal length of cloud-antichains

92-012   Rudolf Ahlswede, Levon H. Kachatrian
         Sharp bounds for cloud-antichains of length two

92-014   Rudolf Ahlswede, Ning Cai
         Rank formulas for certain products of matrices

92-016   Rudolf Ahlswede
         Constant list sizes suffice

92-031   Rudolf Ahlswede, Ning Cai, Zhen Zhang
         Higher Level Extremal Problems

92-066   Rudolf Ahlswede
         On multi-user write-efficient memories

E92-005  Rudolf Ahlswede  
         On set coverings in Cartesian product spaces

93-008   Rudolf Ahlswede, Ning Cai           
         On POS Partitions and Hypergraph Products

93-018   Rudolf Ahlswede, Ning Cai          
         On Edge-Isoperimetric Theorems for Uniform Hypergraphs   

93-019   Rudolf Ahlswede, Ning Cai           
         Models of multi-user write-efficient memories
         and general diametric theorems

93-022   A. Blokhuis, Klaus Metsch, G.E. Moorhouse, 
         Rudolf Ahlswede, Sergej L. Bezrukov          
         On Partitioning the n-Cube into Sets
         with Mutual Distance 1

93-025   R. Ahlswede, L.A. Bassalygo, M.S. Pinsker      
         Binary Constant Weight Codes Correcting Localized Errors 
         and Defects

93-026   R. Ahlswede, L.H. Khachatrian      
         On Extremal Sets Without Coprimes

93-027   R. Ahlswede, L.H. Khachatrian        
         Towards Characterising Equality in Correlation Inequalitites

93-030   R. Ahlswede, N. Cai, U. Tamm      
         Communication Complexity in Lattices

93-036   R. Ahlswede, L.A. Bassalygo, M.S. Pinsker      
         Localized Random and Arbitrary Errors in the Light
         of AV Channel Theory

93-037   R. Ahlswede, N.Cai      
         Incomparability and Intersection Properties of 
         Boolean Interval Lattices and Chain Posets

93-038   R. Ahlswede, N. Cai        
         Cross-Disjoint Pairs of Clouds in the Interval Lattice

93-042   R. Ahlswede, L.H. Khachatrian
         Classical Results on Primitive and Recent Results on
         Cross-Primitive Sequences

93-043   R. Ahlswede, L.H. Khachatrian
         Optimal Pairs of Incomparable Clouds in Multisets

93-049   R. Ahlswede, L.H. Khachatrian
         Density Inequalities for Sets of Multiples

93-060   Rudolf Ahlswede, Levon H. Khachatrian 
         Number Theoretic Correlation Inequalities for
         Dirichlet Densities

93-066   R. Ahlswede, Ning Cai, Zhen Zhang
         On interactive Communication

93-068   R. Ahlswede, Ning Cai, Zhen Zhang 
         Erasure, List and Detection Zero-Error Capacities
            for Low Noise and a Relation to Identification

93-075   R. Ahlswede, H. S. Haroutunian, L. H. Khachatrian
         Messy broadcasting in networks

94-010   Rudolf Ahlswede, Zhen Zhang                               
         New Directions in the Theory of Identification via Channels

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-048   Rudolf Ahlswede, Peter Erdos, Niall Graham
         A Splitting Property of Maximal Antichains
         Combinatorica 15(4), 475-480, 1995

94-055   R. Ahlswede, L. A. Bassalygo, M. S. Pinsker
         Asymptotically Optimal Binary Codes of Polynomial 
         Complexity Correcting Localized Errors
         Proc. IV International Workshop on Algebraic and 
         Combinatorical Coding Theory, Novgorod, 
         Russia, 1-3, 1994

94-067   R. Ahlswede, S.L. Bezrukov                           
         Edge Isoperimetric Theorems for Integer 
         Point Arrays
         Applied Math. Letters, Vol. 8, No. 2, 75-80,1995

94-071   Rudolf Ahlswede, Levon H. Khachatrian 
         Splitting Properties in Partially Ordered Sets
         and Set Systems
         To appear in: Graphs and Combinatorics

94-080   Rudolf Ahlswede, Levon H. Khachatrian
         Maximal Sets of Numbers not Containing k + 1
         Pairwise Coprime Integers
         Acta Arithmetica LXXII, 1, 77-100, 1995

94-090   Rudolf Ahlswede, Ning Cai
         General Edge-Isoperimetric Inequalities
         To appear in: European J. Combin.
         2ter Teil

95-001   Rudolf Ahlswede, Te Sun Han, Kingo Kobayashi
         Universal Coding of Integers and Unbounded Search Trees
         To appear in: IEEE Trans. Inform. Theory

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

95-013   Rudolf Ahlswede, Kingo Kobayashi
         A Simple Proof of the Hook Formula by a Staircase Identity

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

95-036   Rudolf Ahlswede, Levon H. Khachatrian
         Sets of Integers and Quasi-Integers with
         Pairwise Common Divisor
         Acta Arithmetica, LXXIV, 2, 141-153, 1996

95-045   Rudolf Ahlswede, Ning Cai
         Shadows and Isoperimetry under the
            Sequence--Subsequence Relation
         To appear in: Combinatorica

95-059   Rudolf Ahlswede, Levon H. Khachatrian
         Sets of Integers with Pairwise Common Divisor
            and a Factor from a Specified Set of Primes
         Acta Arithmetica, LXV, 3, 259-276, 1996

95-066   Rudolf Ahlswede, Levon H. Khachatrian
         The Complete Intersection Theorem for Systems of Finite Sets
         To appear in: European J. Combin.

95-076   Rudolf Ahlswede, Noga Alon, Peter L. Erdös,
         Miklos Ruszinko, Laszlo A. Szekely Intersecting Systems
         To appear in: Combin. Probab. Comput.

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-101   Rudolf Ahlswede, I. Csiszar
         Common Randomness in Information Theory and Cryptography. 
            Part 2: CR Capacity
         To appear in: IEEE Trans. Inform. Theory

95-102   Rudolf Ahlswede, Levon H. Khachatrian
         The Complete Nontrivial-Intersection Theorem 
            for Systems of Finite Sets
         J. Combin. Theory Ser. A, 121-138,1995

95-106   Rudolf Ahlswede, Ning Cai
         Correlated Sources Help 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-013   Rudolf Ahlswede, Levon H. Khachatrian
         The Diametric Theorem in Hamming Spaces
            --- Optimal Anticodes

96-058   R. Ahlswede, Z. Zhang
         Code Pairs with Specified Parity
         of the Hamming Distances

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

97-005   Rudolf Ahlswede, Zhen Zhang
         Worst Case Estimation of Permutation Invariant
            Functions and Identification via Compressed Data

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-039   R. Ahlswede, B. Balkenhol, L. Khachatrian
         Some Properties of Fix-Free Codes

97-043   Rudolf Ahlswede, Levon H. Khachatrian
         A Pushing-Pulling Method: 
         New Proofs of Intersection Theorems

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

97-051   R. Ahlswede, H. Aydinian, L.H. Khachatrian
         The Intersection Theorem for Direct Products

97-100   R. Ahlswede, L.H. Khachatrian
         A Diametric Theorem for Edges

97-118   Rudolf Ahlswede
         General Theory of Information Transfer

E97-004  R. Ahlswede, M. S. Pinsker
         Report on Models of Write-Efficient Memories with
         Localized Errors and Defects

98-033   Rudolf Ahlswede, Ning Cai, S.-Y. Robert Li, Raymond W. Yeung
         Network Information Flow: Single Source

98-068   Rudolf Ahlswede, Levon H. Khachatrian, András Sárközy
         On the Quotient Sequence of Sequences of Integers

98-075   Rudolf Ahlswede, Ning Cai
         Identification without Randomization

98-077   Rudolf Ahlswede, Levon H. Khachatrian, András Sárközy
         On the Counting Function of Primitive Sets of Integers

98-080   R. Ahlswede, H.K. Aydinian, L.H. Khachatrian
         On Perfect Codes and Related Concepts

E98-010  Bernhard Balkenhol, Ulrich Tamm (editors)
         Symposium "Numbers, Information and Complexity"
         in honour of R. Ahlswede

99-050   Rudolf Ahlswede, Levon H. Khachatrian, Andras Sarközy
         On Prefix-Free and Suffix-Free Sequences of Integers

99-077   R. Ahlswede, L.A. Bassalygo, M.S. Pinsker
         On the Hamming Bound for Nonbinary Localized-Error-Correcting Codes

99-087   Rudolf Ahlswede, Peter Löber
         Quantum Data Processing

99-093   R. Ahlswede, L. Khachatrian, A. Sarközy
         On Primitive Sets of Squarefree Integers

99-104   Rudolf Ahlswede, Christian Bey, Konrad Engel, Levon H. Khachatrian
         The $t$-Intersection Problem in the Truncated Boolean Lattice

99-118   R. Ahlswede, H. Aydinian, L. Khachatrian
         Maximal Number of Constant Weight Vertices of the Unit n-Cube
         Contained in a $k$-Dimensional Subspace




icon Hauptseite icon main site
 
For any questions and problems with this web site please email to cdeppe@Mathematik.Uni-Bielefeld.DE. Last change: 12/10/1998