Juane Li – författare

Using easy-to-follow mathematics, this textbook provides comprehensive coverage of block codes and techniques for reliable communications and data storage. It covers major code designs and constructions from geometric, algebraic, and graph-theoretic points of view, decoding algorithms, error control additive white Gaussian noise (AWGN) and erasure, and dataless recovery. It simplifies a highly mathematical subject to a level that can be understood and applied with a minimum background in mathematics, provides step-by-step explanation of all covered topics, both fundamental and advanced, and includes plenty of practical illustrative examples to assist understanding. Numerous homework problems are included to strengthen student comprehension of new and abstract concepts, and a solutions manual is available online for instructors. Modern developments, including polar codes, are also covered. An essential textbook for senior undergraduates and graduates taking introductory coding courses, students taking advanced full-year graduate coding courses, and professionals working on coding for communications and data storage.

Written by leading experts, this self-contained text provides systematic coverage of LDPC codes and their construction techniques, unifying both algebraic- and graph-based approaches into a single theoretical framework (the superposition construction). An algebraic method for constructing protograph LDPC codes is described, and entirely new codes and techniques are presented. These include a new class of LDPC codes with doubly quasi-cyclic structure, as well as algebraic methods for constructing spatially and globally coupled LDPC codes. Authoritative, yet written using accessible language, this text is essential reading for electrical engineers, computer scientists and mathematicians working in communications and information theory.

Using easy-to-follow mathematics, this textbook provides comprehensive coverage of block codes and techniques for reliable communications and data storage. It covers major code designs and constructions from geometric, algebraic, and graph-theoretic points of view, decoding algorithms, error control additive white Gaussian noise (AWGN) and erasure, and dataless recovery. It simplifies a highly mathematical subject to a level that can be understood and applied with a minimum background in mathematics, provides step-by-step explanation of all covered topics, both fundamental and advanced, and includes plenty of practical illustrative examples to assist understanding. Numerous homework problems are included to strengthen student comprehension of new and abstract concepts, and a solutions manual is available online for instructors. Modern developments, including polar codes, are also covered. An essential textbook for senior undergraduates and graduates taking introductory coding courses, students taking advanced full-year graduate coding courses, and professionals working on coding for communications and data storage.

Written by leading experts, this self-contained text provides systematic coverage of LDPC codes and their construction techniques, unifying both algebraic- and graph-based approaches into a single theoretical framework (the superposition construction). An algebraic method for constructing protograph LDPC codes is described, and entirely new codes and techniques are presented. These include a new class of LDPC codes with doubly quasi-cyclic structure, as well as algebraic methods for constructing spatially and globally coupled LDPC codes. Authoritative, yet written using accessible language, this text is essential reading for electrical engineers, computer scientists and mathematicians working in communications and information theory.