Numbers, Information and Complexity

Front Matter....Pages i-xx
On Prefix-Free and Suffix-Free Sequences of Integers....Pages 1-16
Almost Arithmetic Progressions....Pages 17-20
A Method to Estimate Partial-Period Correlations....Pages 21-27
Splitting Properties in Partially Ordered Sets and Set Systems....Pages 29-44
Old and New Results for the Weighted t-Intersection Problem via AK-Methods....Pages 45-74
Some New Results on Macaulay Posets....Pages 75-94
Minimizing the Absolute Upper Shadow....Pages 95-100
Convex Bounds for the 0,1 Co-Ordinate Deletions Function....Pages 101-104
The Extreme Points of the Probabilistic Capacities Cone Problem....Pages 105-107
On Shifts of Cascades....Pages 109-116
Erdös-Ko-Rado Theorems of Higher Order....Pages 117-124
On the Prague Dimension of Kneser Graphs....Pages 125-128
The Cycle Method and Its Limits....Pages 129-141
Extremal Problems on Δ-Systems....Pages 143-150
The AVC with Noiseless Feedback and Maximal Error Probability: A Capacity Formula with a Trichotomy....Pages 151-176
Calculation of the Asymptotically Optimal Capacity of a T-User M-Frequency Noiseless Multiple-Access Channel....Pages 177-180
A Survey of Coding Methods for the Adder Channel....Pages 181-196
Communication Network with Self-Similar Traffic....Pages 197-219
Error Probabilities for Identification Coding and Least Length Single Sequence Hopping....Pages 221-238
A New Upper Bound on Codes Decodable into Size-2 Lists....Pages 239-244
Constructions of Optimal Linear Codes....Pages 245-263
New Applications and Results of Superimposed Code Theory Arising from the Potentialities of Molecular Biology....Pages 265-282
Rudified Convolutional Encoders....Pages 283-293
On Check Digit Systems Using Anti-Symmetric Mappings....Pages 295-310
Switchings and Perfect Codes....Pages 311-324
On Superimposed Codes....Pages 325-331
The MacWilliams Identity for Linear Codes over Galois Rings....Pages 333-338
On the Structure of a Common Knowledge Created by Correlated Observations and Transmission over Helping Channels....Pages 339-352
How to Broadcast Privacy: Secret Coding for Deterministic Broadcast Channels....Pages 353-368
Asymptotically Tight Bounds on the Key Equivocation Rate for Additive-Like Instantaneous Block Encipherers....Pages 369-374
Space Efficient Linear Time Computation of the Burrows and Wheeler-Transformation....Pages 375-383
Sequences Incompressible by SLZ (LZW), Yet Fully Compressible by ULZ....Pages 385-390
Universal Coding of Non-Prefix Context Tree Sources....Pages 391-402
How Much can You Win when Your Adversary is Handicapped?....Pages 403-412
On Random-Access Data Compaction....Pages 413-420
Universal Lossless Coding of Sources with Large and Unbounded Alphabets....Pages 421-442
Metric Entropy Conditions for Kernels, Schatten Classes and Eigenvalue Problems....Pages 443-451
On Subshifts and Topological Markov Chains....Pages 453-472
Large Deviations Problem for the Shape of a Random Young Diagram with Restrictions....Pages 473-488
BSC: Testing of Hypotheses with Information Constraints....Pages 489-500
The Ahlswede-Daykin Theorem....Pages 501-516
Some Aspects of Random Shapes....Pages 517-523
Decision Support Systems with Multiple Choice Structure....Pages 525-540
Quantum Computers and Quantum Automata....Pages 541-553
Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems....Pages 555-578
Proving the Correctness of Processors with Delayed Branch Using Delayed PC....Pages 579-588
Communication Complexity of Functions on Direct Sums....Pages 589-602
Ordering in Sequence Spaces: An Overview....Pages 603-613
Communication Complexity and BDD Lower Bound Techniques....Pages 615-628
Reminiscences about Professor Ahlswede and a Last Word by Thomas Mann....Pages 629-632
Back Matter....Pages 633-652