product description page
Combinatorial Methods and Models : Rudolf Ahlswede’s Lectures on Information Theory (Vol 4)
about this item
The fourth volume of Rudolf Ahlswede’s lectures on Information Theory is focused on Combinatorics. Rudolf Ahlswede’s original motivation to study combinatorial aspects of Information Theory problems were 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.
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.
Series Title: Foundations in Signal Processing, Communications and Networking
Publisher: Springer Verlag
Volume number: 4
Author: Rudolf Ahlswede
Street Date: July 17, 2017
Item Number (DPCI): 248-42-8163