Information Theory and its applications in theory of computation
This set of lecture notes by Venkatesan Guruswami and Mahdi Cheraghchi addresses the intersection of information theory and theoretical computer science. The core topics to be covered in the lecture note include entropy, Kraft's inequality, source coding theorem, conditional entropy, and mutual information. It also covers KL-divergence, Chernoff bounds, data processing, and Fano's inequalities. Key concepts include AEP, universal source coding using the Lempel-Ziv algorithm, and proof of its optimality. It covers discrete channels and channel capacity, the Noisy Channel Coding Theorem, and how to construct capacity-achieving codes by concatenation and by polar codes. Additional topics: Bregman's theorem, Shearer's Lemma, graph entropy, and applications to optimal set disjointness lower bounds. This text offers a wide-ranging view of how the basic principles of information theory shed light on the construction of algorithms, and the establishment of bounds-on the complexity of problems in the field of theoretical computation.
Author(s): Venkatesan Guruswami and Mahdi Cheraghchi
NA Pages 
An Introduction to Information Theory and Applications
By F. Bavaud, J. C. Chappelier, and J. Kohlas—This long note contains a good survey of information theory and its applications. It introduces the basic ideas of uncertainty and information, then also the more practical extensions such as optimal coding schemes, followed by the theories underlying versions of stationary processes and Markov chains. Other challenges, as the note addresses, pertain to noisy transmission environments in coding. Highlighted here are several advanced topics that follow, including, importantly, error-correcting codes and cryptography. The resource will give both a theoretical background and a practical overview of how to encode, transmit, and secure information effectively. It is a very important guide for those who seek a deep understanding of information theory and how it relates to real problems of communication and data processing.
Author(s): F Bavaud, J C Chappelier and J Kohlas
293 Pages
Advanced Information Theory notes
The lecture notes Advanced Information Theory Notes by Prof. Dr. sc. techn. Gerhard Kramer cover advanced topics in information theory. Information theory within the context of these notes starts with discrete and continuous random variables to base the student in deeper understandings of complicated scenarios. The key areas include channel coding, important for good data transmission; typical sequences and sets, which are fundamental in the theoretical and practical applications of the coding. The text also explores lossy source coding and distributed source coding, which look into how data might be compressed and transmitted with much efficiency. It also covers multiaccess channels, an important aspect in showing just how different sources of data interact. Such a broad-ranging textbook seems particularly suited to readers having a firm grounding in basic information theory, wanting to advance into more advanced areas as well as applications.
Author(s): Prof Dr. sc. techn. Gerhard Kramer
180 Pages
It serves as a basis for everything, from the very basics of thermodynamics and information theory to thermodynamic potentials and distributions, principles of irreversibility, phase space evolution, and beyond. The book informs the readers about the very basics of information theory: basic notions, basic definitions, and applications. It also offers a fresh perspective on the second law of thermodynamics and quantum information, and insights into the modern view of how information theory is intertwined with the laws of physics. This book will be very useful to anyone who wants to gain an understanding of the basic issues in both thermodynamics and information theory and their intersection in current usage.
Author(s): Gregory Falkovich
165 Pages
Information Theory Lecture Notes
Prof. Tsachy Weissman's lecture notes are an excellent summary of the core topics in the subject of information theory. The document initiates with a basic overview of entropy and relative entropy, followed by mutual information and asymptotic equipartition property. Further, it discusses communications theory, channel capacity, and the method of types. It also covers key topics such as typicality-conditioned and joint, lossy compression, and rate-distortion theory. The notes also include joint source-channel coding, where there is quite a good grasp of the principles and applications of information theory. These notes will be very helpful for students and professionals looking forward to structured, comprehensive knowledge about the subject.
Author(s): Prof. Tsachy Weissman
75 Pages
Information Theory for Data Communications and Processing
This is a wide-ranging text by Shlomo Shamai and Abdellatif Zaidi, covering both foundational and advanced topics in information theory applied to data communications and processing. It discusses basic issues, such as information bottleneck problems, unsupervised clustering via methods of the variational information bottleneck, and rate-distortion analysis. It proceeds to get into subjects of a higher level of difficulty: non-orthogonal eMBB and URLLC radio access, robust baseband compression techniques, and amplitude-constrained MIMO channels. Efficient algorithms have been derived for multicasting, content placement in cache networks, and the fundamental limits of caching. The title will be a ready reference for researchers and practitioners interested in the theory and practice of modern communication systems, comprehensively covering recent advancement efforts and applications in information theory.
Author(s): Shlomo Shamai, Abdellatif Zaidi
296 Pages
Information Theory and its applications in theory of computation
This set of lecture notes by Venkatesan Guruswami and Mahdi Cheraghchi addresses the intersection of information theory and theoretical computer science. The core topics to be covered in the lecture note include entropy, Kraft's inequality, source coding theorem, conditional entropy, and mutual information. It also covers KL-divergence, Chernoff bounds, data processing, and Fano's inequalities. Key concepts include AEP, universal source coding using the Lempel-Ziv algorithm, and proof of its optimality. It covers discrete channels and channel capacity, the Noisy Channel Coding Theorem, and how to construct capacity-achieving codes by concatenation and by polar codes. Additional topics: Bregman's theorem, Shearer's Lemma, graph entropy, and applications to optimal set disjointness lower bounds. This text offers a wide-ranging view of how the basic principles of information theory shed light on the construction of algorithms, and the establishment of bounds-on the complexity of problems in the field of theoretical computation.
Author(s): Venkatesan Guruswami and Mahdi Cheraghchi
NA Pages
