The Prague Conferences on Information Theory, Statistical Decision Functions, and Random Processes have been organized every three years since 1956. During the eighteen years of their existence the Prague Conferences developed from a platform for presenting results obtained by a small group of researchers into a probabilistic congress, this being documented by the increasing number of participants as well as of presented papers. The importance of the Seventh Prague Conference has been emphasized by the fact that this Conference was held jointly with the eighth European Meeting of Statisticians. This joint meeting was held from August 18 to 23, 1974 at the Technical University of Prague. The Conference was organized by the Institute of Information Theory and Automation of the Czechoslovak Academy of Sciences and was sponsored by the Czechoslovak Academy of Sciences, by the Committee for the European Region of the Institute of Mathematical Statistics, and by the International As sociation for Statistics in Physical Sciences. More than 300 specialists from 25 countries participated in the Conference. In 57 sessions 164 papers (including 17 invited papers) were read, 128 of which are published in the present two volumes of the Transactions of the Conference. Volume A includes papers related mainly to probability theory and stochastic processes, whereas the papers of Volume B concern mainly statistics and information theory.

The relevance of information theory to statistical theory and its applications to stochastic processes is a unifying influence in these TOPICS. The integral representation of discrimination information is presented in these TOPICS reviewing various approaches used in the literature, and is also developed herein using intrinsically information-theoretic methods. Log likelihood ratios associated with various stochastic processes are computed by an application of minimum discrimination information estimates. Linear discriminant functionals are used in the information-theoretic analysis of a variety of stochastic processes. Sections are numbered serially within each chapter, with a decimal notation for subsections. Equations, examples, theorems and lemmas, are numbered serially within each section with a decimal notation. The digits to the left of the decimal point represent the section and the digits to the right of the decimal point the serial number within the section. When reference is made to a section, equation, example, theorem or lemma within the same chapter only the section number or equation number, etc., is given. When the reference is to a section ,equation, etc., in a different chapter, then in addition to the section or equation etc., number, the chapter number is also given. References to the bibliography are by the author's name followed by the year of publication in parentheses. The transpose of a matrix is denoted by a prime; thus one-row matrices are denoted by primes as the transposes of one-column matrices (vectors).

The calculation of channel capacities was one of Rudolf Ahlswede's specialties and is the main topic of this second volume of his Lectures on Information Theory. Here we find a detailed account of some very classical material from the early days of Information Theory, including developments from the USA, Russia, Hungary and (which Ahlswede was probably in a unique position to describe) the German school centered around his supervisor Konrad Jacobs. These lectures made an approach to a rigorous justification of the foundations of Information Theory. This is the second of several volumes documenting Rudolf Ahlswede's lectures on Information Theory. Each volume includes comments from an invited well-known expert. In the supplement to the present volume, Gerhard Kramer contributes his insights. Classical information processing concerns the main tasks of gaining knowledge and the storage, transmission and hiding of data. The first task is the prime goal of Statistics. For transmission and hiding data, Shannon developed an impressive mathematical theory called Information Theory, which he based on probabilistic models. The theory largely involves the concept of codes with small error probabilities in spite of noise in the transmission, which is modeled by channels. The lectures presented in this work are suitable for graduate students in Mathematics, and also for those working in Theoretical Computer Science, Physics, and Electrical Engineering with a background in basic Mathematics. The lectures can be used as the basis for courses or to supplement courses in many ways. Ph.D. students will also find research problems, often with conjectures, that offer potential subjects for a thesis. More advanced researchers may find questions which form the basis of entire research programs.

Information Theory is studied from the following view points: (1) the theory of entropy as amount of information; (2) the mathematical structure of information sources (probability measures); and (3) the theory of information channels. Shannon entropy and Kolmogorov-Sinai entropy are defined and their basic properties are examined, where the latter entropy is extended to be a linear functional on a certain set of measures. Ergodic and mixing properties of stationary sources are studied as well as AMS (asymptotically mean stationary) sources. The main purpose of this book is to present information channels in the environment of real and functional analysis as well as probability theory. Ergodic channels are characterized in various manners. Mixing and AMS channels are also considered in detail with some illustrations. A few other aspects of information channels including measurability, approximation and noncommutative extensions, are also discussed.

An introduction to information theory for discrete random variables. Classical topics and fundamental tools are presented along with three selected advanced topics. Yeung (Chinese U. of Hong Kong) presents chapters on information measures, zero-error data compression, weak and strong typicality, the I-measure, Markov structures, channel capacity, rate distortion theory, Blahut-Arimoto algorithms, information inequalities, and Shannon-type inequalities. The advanced topics included are single-source network coding, multi-source network coding, and entropy and groups. Annotation copyrighted by Book News, Inc., Portland, OR.