This book is intended to introduce coding theory and information theory to undergraduate students of mathematics and computer science. It begins with a review of probablity theory as applied to finite sample spaces and a general introduction to the nature and types of codes. The two subsequent chapters discuss information theory: efficiency of codes, the entropy of information sources, and Shannon's Noiseless Coding Theorem. The remaining three chapters deal with coding theory: communication channels, decoding in the presence of errors, the general theory of linear codes, and such specific codes as Hamming codes, the simplex codes, and many others.

This book presents a succinct and mathematically rigorous treatment of the main pillars of Shannon’s information theory, discussing the fundamental concepts and indispensable results of Shannon’s mathematical theory of communications. It includes five meticulously written core chapters (with accompanying problems), emphasizing the key topics of information measures; lossless and lossy data compression; channel coding; and joint source-channel coding for single-user (point-to-point) communications systems. It also features two appendices covering necessary background material in real analysis and in probability theory and stochastic processes. The book is ideal for a one-semester foundational course on information theory for senior undergraduate and entry-level graduate students in mathematics, statistics, engineering, and computing and information sciences. A comprehensive instructor’s solutions manual is available.

And the downloadable software gives you the opportunity to see firsthand how various algorithms work, to choose and implement appropriate techniques in your own applications, and to build your own algorithms."--BOOK JACKET.

Graduate-level study for engineering students presents elements of modern probability theory, information theory, coding theory, more. Emphasis on sample space, random variables, capacity, etc. Many reference tables and extensive bibliography. 1961 edition.

Modern, current, and future communications/processing aspects motivate basic information-theoretic research for a wide variety of systems for which we do not have the ultimate theoretical solutions (for example, a variety of problems in network information theory as the broadcast/interference and relay channels, which mostly remain unsolved in terms of determining capacity regions and the like). Technologies such as 5/6G cellular communications, Internet of Things (IoT), and mobile edge networks, among others, not only require reliable rates of information measured by the relevant capacity and capacity regions, but are also subject to issues such as latency vs. reliability, availability of system state information, priority of information, secrecy demands, energy consumption per mobile equipment, sharing of communications resources (time/frequency/space), etc. This book, composed of a collection of papers that have appeared in the Special Issue of the Entropy journal dedicated to “Information Theory for Data Communications and Processing”, reflects, in its eleven chapters, novel contributions based on the firm basic grounds of information theory. The book chapters address timely theoretical and practical aspects that constitute both interesting and relevant theoretical contributions, as well as direct implications for modern current and future communications systems.

Central simple algebras arise naturally in many areas of mathematics. They are closely connected with ring theory, but are also important in representation theory, algebraic geometry and number theory. Recently, surprising applications of the theory of central simple algebras have arisen in the context of coding for wireless communication. The exposition in the book takes advantage of this serendipity, presenting an introduction to the theory of central simple algebras intertwined with its applications to coding theory. Many results or constructions from the standard theory are presented in classical form, but with a focus on explicit techniques and examples, often from coding theory. Topics covered include quaternion algebras, splitting fields, the Skolem-Noether Theorem, the Brauer group, crossed products, cyclic algebras and algebras with a unitary involution. Code constructions give the opportunity for many examples and explicit computations. This book provides an introduction to the theory of central algebras accessible to graduate students, while also presenting topics in coding theory for wireless communication for a mathematical audience. It is also suitable for coding theorists interested in learning how division algebras may be useful for coding in wireless communication.

This comprehensive treatment of network information theory and its applications provides the first unified coverage of both classical and recent results. With an approach that balances the introduction of new models and new coding techniques, readers are guided through Shannon's point-to-point information theory, single-hop networks, multihop networks, and extensions to distributed computing, secrecy, wireless communication, and networking. Elementary mathematical tools and techniques are used throughout, requiring only basic knowledge of probability, whilst unified proofs of coding theorems are based on a few simple lemmas, making the text accessible to newcomers. Key topics covered include successive cancellation and superposition coding, MIMO wireless communication, network coding, and cooperative relaying. Also covered are feedback and interactive communication, capacity approximations and scaling laws, and asynchronous and random access channels. This book is ideal for use in the classroom, for self-study, and as a reference for researchers and engineers in industry and academia.

Briefly, we review the basic elements of computability theory and prob ability theory that are required. Finally, in order to place the subject in the appropriate historical and conceptual context we trace the main roots of Kolmogorov complexity. This way the stage is set for Chapters 2 and 3, where we introduce the notion of optimal effective descriptions of objects. The length of such a description (or the number of bits of information in it) is its Kolmogorov complexity. We treat all aspects of the elementary mathematical theory of Kolmogorov complexity. This body of knowledge may be called algo rithmic complexity theory. The theory of Martin-Lof tests for random ness of finite objects and infinite sequences is inextricably intertwined with the theory of Kolmogorov complexity and is completely treated. We also investigate the statistical properties of finite strings with high Kolmogorov complexity. Both of these topics are eminently useful in the applications part of the book. We also investigate the recursion theoretic properties of Kolmogorov complexity (relations with Godel's incompleteness result), and the Kolmogorov complexity version of infor mation theory, which we may call "algorithmic information theory" or "absolute information theory. " The treatment of algorithmic probability theory in Chapter 4 presup poses Sections 1. 6, 1. 11. 2, and Chapter 3 (at least Sections 3. 1 through 3. 4).

This book examines distributed video coding (DVC) and multiple description coding (MDC), two novel techniques designed to address the problems of conventional image and video compression coding. Covering all fundamental concepts and core technologies, the chapters can also be read as independent and self-sufficient, describing each methodology in sufficient detail to enable readers to repeat the corresponding experiments easily. Topics and features: provides a broad overview of DVC and MDC, from the basic principles to the latest research; covers sub-sampling based MDC, quantization based MDC, transform based MDC, and FEC based MDC; discusses Sleplian-Wolf coding based on Turbo and LDPC respectively, and comparing relative performance; includes original algorithms of MDC and DVC; presents the basic frameworks and experimental results, to help readers improve the efficiency of MDC and DVC; introduces the classical DVC system for mobile communications, providing the developmental environment in detail.

This book introduces readers to the minimum description length (MDL) principle and its applications in learning. The MDL is a fundamental principle for inductive inference, which is used in many applications including statistical modeling, pattern recognition and machine learning. At its core, the MDL is based on the premise that “the shortest code length leads to the best strategy for learning anything from data.” The MDL provides a broad and unifying view of statistical inferences such as estimation, prediction and testing and, of course, machine learning. The content covers the theoretical foundations of the MDL and broad practical areas such as detecting changes and anomalies, problems involving latent variable models, and high dimensional statistical inference, among others. The book offers an easy-to-follow guide to the MDL principle, together with other information criteria, explaining the differences between their standpoints. Written in a systematic, concise and comprehensive style, this book is suitable for researchers and graduate students of machine learning, statistics, information theory and computer science.