Modern coding theory /
Richardson, Thomas J. 1961-
Modern coding theory / Tom Richardson, Rüdiger Urbanke. - Cambridge : Cambridge University Press, 2008. - 1 online resource (xvi, 572 pages) : digital, PDF file(s).
Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Factor graphs -- Binary erasure channel -- Binary memoryless symmetric channels -- General channels -- Turbo codes -- General ensembles -- Expander codes and flipping algorithm -- Encoding low-density parity-check codes -- Effecient implementation of density evolution -- Concentration inequalities -- Formal power sums -- Convexity, degradation, and stability.
Having trouble deciding which coding scheme to employ, how to design a new scheme, or how to improve an existing system? This summary of the state-of-the-art in iterative coding makes this decision more straightforward. With emphasis on the underlying theory, techniques to analyse and design practical iterative coding systems are presented. Using Gallager's original ensemble of LDPC codes, the basic concepts are extended for several general codes, including the practically important class of turbo codes. The simplicity of the binary erasure channel is exploited to develop analytical techniques and intuition, which are then applied to general channel models. A chapter on factor graphs helps to unify the important topics of information theory, coding and communication theory. Covering the most recent advances, this text is ideal for graduate students in electrical engineering and computer science, and practitioners. Additional resources, including instructor's solutions and figures, available online: www.cambridge.org/9780521852296.
9780511791338 (ebook)
Coding theory.
QA268 / .R53 2008
003/.54
Modern coding theory / Tom Richardson, Rüdiger Urbanke. - Cambridge : Cambridge University Press, 2008. - 1 online resource (xvi, 572 pages) : digital, PDF file(s).
Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Factor graphs -- Binary erasure channel -- Binary memoryless symmetric channels -- General channels -- Turbo codes -- General ensembles -- Expander codes and flipping algorithm -- Encoding low-density parity-check codes -- Effecient implementation of density evolution -- Concentration inequalities -- Formal power sums -- Convexity, degradation, and stability.
Having trouble deciding which coding scheme to employ, how to design a new scheme, or how to improve an existing system? This summary of the state-of-the-art in iterative coding makes this decision more straightforward. With emphasis on the underlying theory, techniques to analyse and design practical iterative coding systems are presented. Using Gallager's original ensemble of LDPC codes, the basic concepts are extended for several general codes, including the practically important class of turbo codes. The simplicity of the binary erasure channel is exploited to develop analytical techniques and intuition, which are then applied to general channel models. A chapter on factor graphs helps to unify the important topics of information theory, coding and communication theory. Covering the most recent advances, this text is ideal for graduate students in electrical engineering and computer science, and practitioners. Additional resources, including instructor's solutions and figures, available online: www.cambridge.org/9780521852296.
9780511791338 (ebook)
Coding theory.
QA268 / .R53 2008
003/.54