GTIT-C 2006

• Rudolf Ahlswede:
  Introduction. 1-44
  
• Rudolf Ahlswede:
  Rudolf Ahlswede - From 60 to 66. 45-48
  
• Rudolf Ahlswede:
  Information Theory and Some Friendly Neighbors - Ein Wunschkonzert. 49-50
  

Probabilistic Models

• Rudolf Ahlswede, Bernhard Balkenhol, Christian Kleinewächter:
  Identification for Sources. 51-61
  
• Christian Kleinewächter:
  On Identification. 62-83
  
• Lars Bäumer:
  Identification and Prediction. 84-106
  
• Rudolf Ahlswede, Ning Cai:
  Watermarking Identification Codes with Related Topics on Common Randomness. 107-153
  
• Ashot N. Harutyunyan:
  Notes on Conditions for Successive Refinement of Information. 154-164
  
• Bálint Laczay:
  Coding for the Multiple-Access Adder Channel. 165-195
  
• Mariam E. Haroutunian:
  Bounds of E-Capacity for Multiple-Access Channel with Random Parameter. 196-217
  
• Sándor Csibi, Edward C. van der Meulen:
  Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint. 218-248
  
• Rudolf Ahlswede, Ning Cai:
  Codes with the Identifiable Parent Property and the Multiple-Access Channel. 249-257
  

Cryptology - Pseudo Random Sequences

• Rudolf Ahlswede, Ning Cai:
  Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder. 258-275
  
• Zhaozhi Zhang:
  A Simplified Method for Computing the Key Equivocation for Additive-Like Instantaneous Block Encipherers. 276-284
  
• Rudolf Ahlswede, Ning Cai, Zhaozhi Zhang:
  Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer. 285-292
  
• Rudolf Ahlswede, Christian Mauduit, András Sárközy:
  Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part I. 293-307
  
• Rudolf Ahlswede, Christian Mauduit, András Sárközy:
  Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part II. 308-325
  
• Katalin Gyarmati:
  On a Fast Version of a Pseudorandom Generator. 326-342
  
• Joël Rivat, András Sárközy:
  On Pseudorandom Sequences and Their Application. 343-361
  
• Mikhail B. Malyutov:
  Authorship Attribution of Texts: A Review. 362-380
  

Quantum Models

• Armin Uhlmann:
  Raum-Zeit und Quantenphysik - Ein Geburtstagsständchen für Hans-Jürgen Treder. 381-393
  
• Armin Uhlmann:
  Quantum Information Transfer from One System to Another One. 394-412
  
• Armin Uhlmann:
  On Rank Two Channels. 413-424
  
• Jozef Gruska:
  Universal Sets of Quantum Information Processing Primitives and Their Optimal Use. 425-451
  
• Erdal Arikan:
  An Upper Bound on the Rate of Information Transfer by Grover's Oracle. 452-459
  
• Rudolf Ahlswede, Ning Cai:
  A Strong Converse Theorem for Quantum Multiple Access Channels. 460-485
  
• Andreas Winter:
  Identification Via Quantum Channels in the Presence of Prior Correlation and Feedback. 486-504
  
• Melvyn B. Nathanson:
  Additive Number Theory and the Ring of Quantum Integers. 505-511
  
• Frank Hampel:
  The Proper Fiducial Argument. 512-526
  
• Mikhail B. Malyutov, Dmitry M. Malyutov:
  On Sequential Discrimination Between Close Markov Chains. 527-534
  
• Rudolf Ahlswede, Zheng Zhang:
  Estimating with Randomized Encoding the Joint Empirical Distribution in a Correlated Source. 535-546
  
• Rudolf Ahlswede, Ella Aloyan, Evgueni A. Haroutunian:
  On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Sources with Side Information. 547-552
  
• Rudolf Ahlswede, Evgueni A. Haroutunian:
  On Logarithmically Asymptotically Optimal Testing of Hypotheses and Identification. 553-571
  
• Rudolf Ahlswede, Vladimir Blinovsky:
  Correlation Inequalities in Function Spaces. 572-577
  
• Peter Harremoës:
  Lower Bounds for Divergence in the Central Limit Theorem. 578-594
  

Information Measures - Error Concepts - Performance Criteria

• Rudolf Ahlswede:
  Identification Entropy. 595-613
  
• Vieri Benci, Stefano Galatolo:
  Optimal Information Measures for Weakly Chaotic Dynamical Systems. 614-627
  
• Rudolf Ahlswede, Mark S. Pinsker:
  Report on Models of Write-Efficient Memories with Localized Errors and Defects. 628-632
  
• Kingo Kobayashi, Hiroyoshi Morita, Mamoru Hoshi:
  Percolation on a k-Ary Tree. 633-638
  
• Rudolf Ahlswede:
  On Concepts of Performance Parameters for Channels. 639-663
  
• Rudolf Ahlswede, János Körner:
  Appendix: On Common Information and Related Characteristics of Correlated Information Sources. 664-677
  

Search - Sorting - Ordering - Planning

• Ferdinando Cicalese, Christian Deppe:
  Q-Ary Ulam-Renyi Game with Constrained Lies. 678-694
  
• Rudolf Ahlswede, Ning Cai:
  Search with Noisy and Delayed Responses. 695-703
  
• Rudolf Ahlswede, Ning Cai:
  A Kraft-Type Inequality for d-Delay Binary Search Codes. 704-706
  
• Peter Damaschke:
  Threshold Group Testing. 707-718
  
• Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich:
  A Fast Suffix-Sorting Algorithm. 719-734
  
• Marina Kyureghyan:
  Monotonicity Checking. 735-739
  
• Stefano Carpin:
  Algorithmic Motion Planning: The Randomized Approach. 740-768
  

Language Evolution - Pattern Discovery - Reconstructions

• Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe:
  Information Theoretic Models in Language Evolution. 769-787
  
• Peter Harremoës, Flemming Topsøe:
  Zipf's Law, Hyperbolic Distributions and Entropy Loss. 788-792
  
• Alberto Apostolico, Matteo Comin, Laxmi Parida:
  Bridging Lossy and Lossless Compression by Motif Pattern Discovery. 793-813
  
• Arkadii G. D'yachkov, David C. Torney, Pavel A. Vilenkin, Scott White:
  Reverse-Complement Similarity Codes. 814-830
  
• Elena V. Konstantinova:
  On Some Applications of Information Indices in Chemical Graph Theory. 831-852
  
• Sergey G. Molodtsov:
  Largest Graphs of Diameter 2 and Maximum Degree 6. 853-857
  

Network Coding

• Rudolf Ahlswede:
  An Outside Opinion. 858-860
  
• Søren Riis, Rudolf Ahlswede:
  Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis "Utilising Public Information in Network Coding". 861-897
  

Combinatorial Models

Coverings

• Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov:
  On the Thinnest Coverings of Spheres and Ellipsoids with Balls in Hamming and Euclidean Spaces. 898-925
  
• Rudolf Ahlswede:
  Appendix: On Set Coverings in Cartesian Product Spaces. 926-937
  

Partitions

• Sergey V. Avgustinovich, Anastasia Yu. Vasil'eva:
  Testing Sets for 1-Perfect Code. 938-940
  
• Rudolf Ahlswede, Alexander Yudin:
  On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections. 941-954
  

Isoperimetry

• Rudolf Ahlswede, Levon H. Khachatrian:
  On Attractive and Friendly Sets in Sequence Spaces. 955-970
  
• Christian Bey:
  Remarks on an Edge Isoperimetric Problem. 971-978
  
• Rudolf Ahlswede, Ning Cai:
  Appendix: On Edge-Isoperimetric Theorems for Uniform Hypergraphs. 979-1005
  

Isodiametry

• Rudolf Ahlswede:
  Appendix: Solution of Burnashev's Problem and a Sharpening of the Erdös/Ko/Rado Theorem. 1006-1009
  

Networks

• Thomas Kalinowski:
  Realization of Intensity Modulated Radiation Fields Using Multileaf Collimators. 1010-1055
  
• Rudolf Ahlswede, Harout K. Aydinian:
  Sparse Asymmetric Connectors in Communication Networks. 1056-1062
  

Problem Section

• Rudolf Ahlswede:
  Finding C_NRI(W), the Identification Capacity of the AVC W, if Randomization in the Encoding Is Excluded. 1063
  
• Rudolf Ahlswede, Iskandar Karapetyan:
  Intersection Graphs of Rectangles and Segments. 1064-1065
  
• Erdal Arikan:
  Cutoff Rate Enhancement. 1066-1068
  
• Stefan Artmann:
  Some Problems in Organic Coding Theory. 1069-1072
  
• Harout K. Aydinian:
  Generalized Anticodes in Hamming Spaces. 1073-1074
  
• Vladimir Blinovsky:
  Two Problems from Coding Theory. 1075
  
• Ning Cai:
  Private Capacity of Broadcast Channels. 1076-1078
  
• Christian Elsholtz:
  A Short Survey on Upper and Lower Bounds for Multidimensional Zero Sums. 1079-1080
  
• Torleiv Kløve:
  Binary Linear Codes That Are Optimal for Error Correction. 1081-1083
  
• Kingo Kobayashi:
  Capacity Problem of Trapdoor Channel. 1084-1087
  
• Eduardo Sany Laber:
  Hotlink Assignment on the Web. 1088-1092
  
• Vasilij S. Lebedev:
  The Rigidity of Hamming Spaces. 1093-1094
  
• Uwe Leck:
  A Conjecture in Finite Fields. 1095-1096
  
• Maciej Liskiewicz:
  Multiparty Computations in Non-private Environments. 1097-1099
  
• Hiroshi Nagaoka:
  Some Mathematical Problems Related to Quantum Hypothesis Testing. 1100-1103
  
• Faina I. Solov'eva:
  Designs and Perfect Codes. 1104-1105
  

Last update Wed Feb 15 05:03:07 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page