**Information Theory and Network Coding** by Raymond W. Yeung is a comprehensive textbook that covers both information theory and network coding. The book builds upon the author's earlier work, *A First Course in Information Theory*, and incorporates new developments in network coding, which has evolved into a significant research area in information science. It provides a unified and coherent presentation of fundamental results in information theory and network coding, making it suitable for use in an electrical engineering course. The book is divided into two parts. Part I covers the components of information theory, including information measures, I-measure, entropy, and information inequalities. Part II focuses on the fundamentals of network coding, discussing topics such as the butterfly network, the max-flow bound, and various types of network codes. Part I introduces key concepts in information theory, such as entropy, mutual information, and information measures for discrete and continuous random variables. It also covers topics like weak and strong typicality, discrete memoryless channels, rate-distortion theory, and the Blahut-Arimoto algorithms. The book provides a thorough treatment of information inequalities and their implications, as well as their connection to group theory. Part II explores network coding, starting with the butterfly network as a primary example. It discusses the max-flow bound, linear network codes on acyclic and cyclic networks, and multi-source network coding. The book also addresses the implications of information inequalities in network coding and provides a framework for analyzing achievable information rate regions. The book is written in a clear and systematic manner, with a focus on deriving results from first principles. It includes numerous examples, summaries at the end of each chapter, and a comprehensive instructor's manual. It is suitable for both a textbook and a reference book, and can be used for a two-semester course. The book is accompanied by an errata list and is available online for further information.**Information Theory and Network Coding** by Raymond W. Yeung is a comprehensive textbook that covers both information theory and network coding. The book builds upon the author's earlier work, *A First Course in Information Theory*, and incorporates new developments in network coding, which has evolved into a significant research area in information science. It provides a unified and coherent presentation of fundamental results in information theory and network coding, making it suitable for use in an electrical engineering course. The book is divided into two parts. Part I covers the components of information theory, including information measures, I-measure, entropy, and information inequalities. Part II focuses on the fundamentals of network coding, discussing topics such as the butterfly network, the max-flow bound, and various types of network codes. Part I introduces key concepts in information theory, such as entropy, mutual information, and information measures for discrete and continuous random variables. It also covers topics like weak and strong typicality, discrete memoryless channels, rate-distortion theory, and the Blahut-Arimoto algorithms. The book provides a thorough treatment of information inequalities and their implications, as well as their connection to group theory. Part II explores network coding, starting with the butterfly network as a primary example. It discusses the max-flow bound, linear network codes on acyclic and cyclic networks, and multi-source network coding. The book also addresses the implications of information inequalities in network coding and provides a framework for analyzing achievable information rate regions. The book is written in a clear and systematic manner, with a focus on deriving results from first principles. It includes numerous examples, summaries at the end of each chapter, and a comprehensive instructor's manual. It is suitable for both a textbook and a reference book, and can be used for a two-semester course. The book is accompanied by an errata list and is available online for further information.