General Theory of Information Transfer and Combinatorics

Identification and Prediction

Pages 84-106

Bäumer, L.

Watermarking Identification Codes with Related Topics on Common Randomness

Pages 107-153

Ahlswede, R. (et al.)

Notes on Conditions for Successive Refinement of Information

Pages 154-164

Harutyunyan, A. N.

Coding for the Multiple-Access Adder Channel

Pages 165-195

Laczay, B.

Bounds of E-Capacity for Multiple-Access Channel with Random Parameter

Pages 196-217

Haroutunian, M. E.

Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint

Pages 218-248

Csibi, S. (et al.)

Codes with the Identifiable Parent Property and the Multiple-Access Channel

Pages 249-257

Ahlswede, R. (et al.)

Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder

Pages 258-275

Ahlswede, R. (et al.)

A Simplified Method for Computing the Key Equivocation for Additive-Like Instantaneous Block Encipherers

Pages 276-284

Zhang, Z.

Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer

Pages 285-292

Ahlswede, R. (et al.)

Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I

Pages 293-307

Ahlswede, R. (et al.)

Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II

Pages 308-325

Ahlswede, R. (et al.)

On a Fast Version of a Pseudorandom Generator

Pages 326-342

Gyarmati, K.

On Pseudorandom Sequences and Their Application

Pages 343-361

Rivat, J. (et al.)

Authorship Attribution of Texts: A Review

Pages 362-380

Malyutov, M. B.

Raum-Zeit und Quantenphysik – Ein Geburtstagsständchen für Hans-Jürgen Treder

Pages 381-393

Uhlmann, A.

Quantum Information Transfer from One System to Another One

Pages 394-412

Uhlmann, A.

On Rank Two Channels

Pages 413-424

Uhlmann, A.

Universal Sets of Quantum Information Processing Primitives and Their Optimal Use

Pages 425-451

Gruska, J.

An Upper Bound on the Rate of Information Transfer by Grover’s Oracle

Pages 452-459

Arikan, E.

A Strong Converse Theorem for Quantum Multiple Access Channels

Pages 460-485

Ahlswede, R. (et al.)

Identification Via Quantum Channels in the Presence of Prior Correlation and Feedback

Pages 486-504

Winter, A.

Additive Number Theory and the Ring of Quantum Integers

Pages 505-511

Nathanson, M. B.

The Proper Fiducial Argument

Pages 512-526

Hampel, F.

On Sequential Discrimination Between Close Markov Chains

Pages 527-534

Malyutov, M. B. (et al.)

Estimating with Randomized Encoding the Joint Empirical Distribution in a Correlated Source

Pages 535-546

Ahlswede, R. (et al.)

On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Sources with Side Information

Pages 547-552

Ahlswede, R. (et al.)

On Logarithmically Asymptotically Optimal Testing of Hypotheses and Identification

Pages 553-571

Ahlswede, R. (et al.)

Correlation Inequalities in Function Spaces

Pages 572-577

Ahlswede, R. (et al.)

Lower Bounds for Divergence in the Central Limit Theorem

Pages 578-594

Harremoës, Peter

Identification Entropy

Pages 595-613

Ahlswede, R.

Optimal Information Measures for Weakly Chaotic Dynamical Systems

Pages 614-627

Benci, V. (et al.)

Report on Models of Write–Efficient Memories with Localized Errors and Defects

Pages 628-632

Ahlswede, R. (et al.)

Percolation on a k-Ary Tree

Pages 633-638

Kobayashi, K. (et al.)

On Concepts of Performance Parameters for Channels

Pages 639-663

Ahlswede, R.

Appendix: On Common Information and Related Characteristics of Correlated Information Sources

Pages 664-677

Ahlswede, R. (et al.)

Q-Ary Ulam-Renyi Game with Constrained Lies

Pages 678-694

Cicalese, F. (et al.)

Search with Noisy and Delayed Responses

Pages 695-703

Ahlswede, R. (et al.)

A Kraft–Type Inequality for d–Delay Binary Search Codes

Pages 704-706

Ahlswede, R. (et al.)

Threshold Group Testing

Pages 707-718

Damaschke, P.

A Fast Suffix-Sorting Algorithm

Pages 719-734

Ahlswede, R. (et al.)

Monotonicity Checking

Pages 735-739

Kyureghyan, M.

Algorithmic Motion Planning: The Randomized Approach

Pages 740-768

Carpin, S.

Information Theoretic Models in Language Evolution

Pages 769-787

Ahlswede, R. (et al.)

Zipf’s Law, Hyperbolic Distributions and Entropy Loss

Pages 788-792

Harremoës, P. (et al.)

Bridging Lossy and Lossless Compression by Motif Pattern Discovery

Pages 793-813

Apostolico, A. (et al.)

Reverse–Complement Similarity Codes

Pages 814-830

D’yachkov, A. (et al.)

On Some Applications of Information Indices in Chemical Graph Theory

Pages 831-852

Konstantinova, E. V.

Largest Graphs of Diameter 2 and Maximum Degree 6

Pages 853-857

Molodtsov, S. G.

An Outside Opinion

Pages 858-860

Ahlswede, R.

Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis “Utilising Public Information in Network Coding”

Pages 861-897

Riis, S. (et al.)

On the Thinnest Coverings of Spheres and Ellipsoids with Balls in Hamming and Euclidean Spaces

Pages 898-925

Dumer, I. (et al.)

Appendix: On Set Coverings in Cartesian Product Spaces

Pages 926-937

Ahlswede, R.

Testing Sets for 1-Perfect Code

Pages 938-940

Avgustinovich, S. V. (et al.)

On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections

Pages 941-954

Ahlswede, R. (et al.)

On Attractive and Friendly Sets in Sequence Spaces

Pages 955-970

Ahlswede, R. (et al.)

Remarks on an Edge Isoperimetric Problem

Pages 971-978

Bey, C.

Appendix: On Edge–Isoperimetric Theorems for Uniform Hypergraphs

Pages 979-1005

Ahlswede, R. (et al.)

Appendix: Solution of Burnashev’s Problem and a Sharpening of the Erdős/Ko/Rado Theorem

Pages 1006-1009

Ahlswede, R.

Realization of Intensity Modulated Radiation Fields Using Multileaf Collimators

Pages 1010-1055

Kalinowski, T.

Sparse Asymmetric Connectors in Communication Networks

Pages 1056-1062

Ahlswede, R. (et al.)

Finding $C_{\text{NRI}}({\mathcal W})$, the Identification Capacity of the AVC ${\mathcal W}$, if Randomization in the Encoding Is Excluded

Pages 1063-1063

Ahlswede, R.

Intersection Graphs of Rectangles and Segments

Pages 1064-1065

Ahlswede, R. (et al.)

Cutoff Rate Enhancement

Pages 1066-1068

Arikan, E.

Some Problems in Organic Coding Theory

Pages 1069-1072

Artmann, S.

Generalized Anticodes in Hamming Spaces

Pages 1073-1074

Aydinian, H.

Two Problems from Coding Theory

Pages 1075-1075

Blinovsky, V.

Private Capacity of Broadcast Channels

Pages 1076-1078

Cai, N.

A Short Survey on Upper and Lower Bounds for Multidimensional Zero Sums

Pages 1079-1080

Elsholtz, C.

Binary Linear Codes That Are Optimal for Error Correction

Pages 1081-1083

Kløve, T.

Capacity Problem of Trapdoor Channel

Pages 1084-1087

Kobayashi, K.

Hotlink Assignment on the Web

Pages 1088-1092

Laber, E. S.

The Rigidity of Hamming Spaces

Pages 1093-1094

Lebedev, V. S.

A Conjecture in Finite Fields

Pages 1095-1096

Leck, U.

Multiparty Computations in Non-private Environments

Pages 1097-1099

Liśkiewicz, M.

Some Mathematical Problems Related to Quantum Hypothesis Testing

Pages 1100-1103

Nagaoka, Hiroshi

Designs and Perfect Codes

Pages 1104-1105

Solov’eva, F. I.