Fundamentals of Codes, Graphs, and Iterative Decoding is an explanation of how to introduce local connectivity, and how to exploit simple structural descriptions. Chapter 1 provides an overview of Shannon theory and the basic tools of complexity theory, communication theory, and bounds on code construction. Chapters 2 - 4 provide an overview of "classical" error control coding, with an introduction to abstract algebra, and block and convolutional codes. Chapters 5 - 9 then proceed to systematically develop the key research results of the 1990s and early 2000s with an introduction to graph theory, followed by chapters on algorithms on graphs, turbo error control, low density parity check codes, and low density generator codes.

Fundamentals of Convolutional Coding, Second Edition, regarded as a bible of convolutional coding brings you a clear and comprehensive discussion of the basic principles of this field Two new chapters on low-density parity-check (LDPC) convolutional codes and iterative coding Viterbi, BCJR, BEAST, list, and sequential decoding of convolutional codes Distance properties of convolutional codes Includes a downloadable solutions manual

An unparalleled learning tool and guide to error correction coding Error correction coding techniques allow the detection and correction of errors occurring during the transmission of data in digital communication systems. These techniques are nearly universally employed in modern communication systems, and are thus an important component of the modern information economy. Error Correction Coding: Mathematical Methods and Algorithms provides a comprehensive introduction to both the theoretical and practical aspects of error correction coding, with a presentation suitable for a wide variety of audiences, including graduate students in electrical engineering, mathematics, or computer science. The pedagogy is arranged so that the mathematical concepts are presented incrementally, followed immediately by applications to coding. A large number of exercises expand and deepen students' understanding. A unique feature of the book is a set of programming laboratories, supplemented with over 250 programs and functions on an associated Web site, which provides hands-on experience and a better understanding of the material. These laboratories lead students through the implementation and evaluation of Hamming codes, CRC codes, BCH and R-S codes, convolutional codes, turbo codes, and LDPC codes. This text offers both "classical" coding theory-such as Hamming, BCH, Reed-Solomon, Reed-Muller, and convolutional codes-as well as modern codes and decoding methods, including turbo codes, LDPC codes, repeat-accumulate codes, space time codes, factor graphs, soft-decision decoding, Guruswami-Sudan decoding, EXIT charts, and iterative decoding. Theoretical complements on performance and bounds are presented. Coding is also put into its communications and information theoretic context and connections are drawn to public key cryptosystems. Ideal as a classroom resource and a professional reference, this thorough guide will benefit electrical and computer engineers, mathematicians, students, researchers, and scientists.

Constrained Coding and Soft Iterative Decoding is the first work to combine the issues of constrained coding and soft iterative decoding (e.g., turbo and LDPC codes) from a unified point of view. Since constrained coding is widely used in magnetic and optical storage, it is necessary to use some special techniques (modified concatenation scheme or bit insertion) in order to apply soft iterative decoding. Recent breakthroughs in the design and decoding of error-control codes (ECCs) show significant potential for improving the performance of many communications systems. ECCs such as turbo codes and low-density parity check (LDPC) codes can be represented by graphs and decoded by passing probabilistic (a.k.a. `soft') messages along the edges of the graph. This message-passing algorithm yields powerful decoders whose performance can approach the theoretical limits on capacity. This exposition uses `normal graphs,' introduced by Forney, which extend in a natural manner to block diagram representations of the system and provide a simple unified framework for the decoding of ECCs, constrained codes, and channels with memory. Soft iterative decoding is illustrated by the application of turbo codes and LDPC codes to magnetic recording channels. For magnetic and optical storage, an issue arises in the use of constrained coding, which places restrictions on the sequences that can be transmitted through the channel; the use of constrained coding in combination with soft ECC decoders is addressed by the modified concatenation scheme also known as `reverse concatenation.' Moreover, a soft constraint decoder yields additional coding gain from the redundancy in the constraint, which may be of practical interest in the case of optical storage. In addition, this monograph presents several other research results (including the design of sliding-block lossless compression codes, and the decoding of array codes as LDPC codes). Constrained Coding and Soft Iterative Decoding will prove useful to students, researchers and professional engineers who are interested in understanding this new soft iterative decoding paradigm and applying it in communications and storage systems.

The last few years have witnessed rapid advancements in information and coding theory research and applications. This book provides a comprehensive guide to selected topics, both ongoing and emerging, in information and coding theory. Consisting of contributions from well-known and high-profile researchers in their respective specialties, topics that are covered include source coding; channel capacity; linear complexity; code construction, existence and analysis; bounds on codes and designs; space-time coding; LDPC codes; and codes and cryptography.All of the chapters are integrated in a manner that renders the book as a supplementary reference volume or textbook for use in both undergraduate and graduate courses on information and coding theory. As such, it will be a valuable text for students at both undergraduate and graduate levels as well as instructors, researchers, engineers, and practitioners in these fields.Supporting Powerpoint Slides are available upon request for all instructors who adopt this book as a course text.

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.

This book introduces the theoretical elements at the basis of various classes of algorithms commonly employed in the physical layer (and, in part, in MAC layer) of wireless communications systems. It focuses on single user systems, so ignoring multiple access techniques. Moreover, emphasis is put on single-input single-output (SISO) systems, although some relevant topics about multiple-input multiple-output (MIMO) systems are also illustrated. Comprehensive wireless specific guide to algorithmic techniques Provides a detailed analysis of channel equalization and channel coding for wireless applications Unique conceptual approach focusing in single user systems Covers algebraic decoding, modulation techniques, channel coding and channel equalisation