General Theory of Information Transfer

The ZiF – Center for Interdisciplinary Research of the University of Bielefeld – supports the research group "General Theory of Information Transfer and Combinatorics" from October 2001 – August 2004, with its central research year from October 2002 – August 2003. The main goal of the research project is further development of the General Theory of Information Transfer both along theoretical and experimental lines.

The two preparatory conferences serve as a first forum for an exchange of ideas between information theorists and researchers from fields where notions of information play an essential role including scientists from mathematics, biology, chemistry, physics, computer science and, to a small extent, humanities. At a later stage, after elaboration of mathematically treatable models and problems, attempts for a solution will be made by researchers with strong mathematical background. Often new combinatorial problems arise, which sometimes can be treated with known methods, but in a lot of cases also require new combinatorial methods. In this sense there is an interplay between information problems from several research fields and combinatorics.

In the first meeting information theorists will provide, in particular for the researchers from other fields, a common language about notions of mathematical information theory and will present basic and new results, especially newer methods from the general theory of information transfer. The list of topics for sessions of this meeting includes: General Theory of Information Transfer, Informational Aspects of Algorithms for Large and Complex Networks, Applications of the Theory of Identification (Prediction, Alarm Systems, Watermarking), Coding Theory, Reconstruction of Sequences and Pool Testing in Natural and Social Sciences, Numbertheoretical Approach to Pseudo – Random – Number Generation. General Theory of Information Transfer

Titles:

	Rudolf Ahlswede: Introductory Remarks
	James L. Massey: Information Transfer with Feedback
	Sándor Csibi: Properties of Codes for Identification via a Multiple Access Channel Under a Word-Length Constraint
	Edward C. van der Meulen: On the Duality Between Successive Refinement of Information by Source Coding with Fidelity Constraints and Efficient Multi-Level Channel Coding Under Cost Constraints
	Sergey Stasevich: An Inequality for Input Degraded Channels
	Faina I. Solov'eva: On Perfect Binary Codes
	Harout Aydinian: On Bohman's Conjecture Related to a Sum Packing Problem of Erdös
	Vladimir Blinovsky: New Approach to the Estimation of the Probability of Decoding Error
	Stavros Konstantinidis: General Models of Discrete Channels and the Properties of Error Detection and Error Correction
	Vladimir Balakirsky: On the Performance of Permutation Codes for Multi-User Communication
	Ludo Tolhuizen: Coding for Informed Decoders
	Vladimir Levenshtein: Combinatorial and Probabilistic Problems of Sequence Reconstruction
	Pavel Vilenkin: On a Class of Codes for the Insertion-Deletion Metric
	Arkadii Dyachkov: Statistical Estimation of Average Distances for the Insertion-Deletion Metric
	Gyula Katona: A Coding Problem for Pairs of Sets
	Hyun Kwang Kim: On Optimal Superimposed Codes
	Ulrich Tamm: Some Aspects of Hankel Matrices in Coding Theory and Combinatorics
	Lloyd Demetrius: Entropy in Thermodynamics and Evolution
	Friedhelm Meyer auf der Heide: Data Management in Networks
	Rüdiger Reischuk: Algorithmic Aspects of Distributions, Errors and Information
	Maciej Liskiewicz: Private Computations on k-Connected Communication Networks
	Helmut Jürgensen: Synchronizing Codes
	Alexander Barg: Error Exponents of Expander Codes Under Linear Time Decoding
	Timothy Havel: Quantum Information Science and Technology
	Alexei Ashikhmin: Nonbinary Quantum Stabilizer Codes
	Viacheslav Prelov: Epsilon-Entropy of Ellipsoids in a Hamming-Space
	Mariam Harutyunyan: Bounds for the Rate-Reliability Function of Multi-User Channels
	Anahit Gharzaryan: On the Shannon Cipher system with a wiretapper guessing subject to distortion and reliability
	Paul Algoet: Universal Parsimonious Prequential Modeling Schemes for Stationary Processes with Densities
	Boris Ryabko: The Nonprobabilistic Approach to Learning the Best Prediction
	Ning Cai: Watermarking Identification Codes with Related Topics on Common Randomness
	Julien Cassaigne: Palindrome Complexity
	Christian Mauduit: Measures of Pseudorandomness for Finite Sequences
	Andras Sárközy: Construction of High Quality Pseudorandom Binary Sequences
	Joël Rivat: On Computational Aspects of Pseudorandom Sequences
	Katalin Gyarmati: On a Pseudorandom Property of Binary Sequences
	Kingo Kobayashi: When the Entropy Function Appears in the Residue
	Peter Harremoes: Information Theoretic Aspects of Poisson's Law
	Franz Merkl: Moderate Deviations for Longest Increasing Subsequences in Random Permutations