Combinatorial Methods and Models: Rudolf Ahlswede’s Lectures on Information Theory 4 by Rudolf Ahlswede, Alexander Ahlswede , Ingo Althofer , Christian Deppe , Ulrich Tamm
Requirements: pdf reader, 2.4 mb
Overview: The fourth volume of Rudolf Ahlswede’s lectures on Information Theory is focused on Combinatorics. Ahlswede was originally motivated to study combinatorial aspects of Information Theory via zero-error codes: in this case the structure of the coding problems usually drastically changes from probabilistic to combinatorial. The best example is Shannon’s zero error capacity, where independent sets in graphs have to be examined. The extension to multiple access channels leads to the Zarankiewicz problem.
A code can be regarded combinatorially as a hypergraph; and many coding theorems can be obtained by appropriate colourings or coverings of the underlying hypergraphs. Several such colouring and covering techniques and their applications are introduced in this book. Furthermore, codes produced by permutations and one of Ahlswede’s favourite research fields — extremal problems in Combinatorics — are presented.
Whereas the first part of the book concentrates on combinatorial methods in order to analyse classical codes as prefix codes or codes in the Hamming metric, the second is devoted to combinatorial models in Information Theory. Here the code concept already relies on a rather combinatorial structure, as in several concrete models of multiple access channels or more refined distortions. An analytical tool coming into play, especially during the analysis of perfect codes, is the use of orthogonal polynomials.
Genre: Science & Math › Mathematics
Download Instructions:
http://ceesty.com/wCO4y4
mirror:
http://ceesty.com/wCO4uo
