M O D E R N C O D I N G T H E O R Y – S O L U T I O N S M A N U A L
Preliminary version – October 28, 2008
Preliminary version – October 28, 2008
Modern Coding ¿eory –
Solutions Manual
B Y
T . R I C H A R D S O N A N D R . U R B A N K E
Cambridge University Press
Preliminary version – October 28, 2008
Modern Coding ¿eory – Solutions Manual
Copyright ©2008 by T. Richardson and R. Urbanke
All rights reserved
Library of Congress Catalog Card Number: 00–00000
isbn 0-000-00000-0
Preliminary version – October 28, 2008
C O N T E N T S
1
Introduction page 3
2 Factor Graphs page 17
3 Binary Erasure Channel page 21
4 Binary Memoryless Symmetric Channels page 41
5 General Channels page 77
6 Convolutional Codes and Turbo Codes page 81
7 General Ensembles page 89
8 Expander Codes and the Flipping Algorithm page 93
A Encoding Low-Density Parity-Check Codes page 95
B Efficient Implementation of Density Evolution page 97
C Concentration Inequalities page 101
D Formal Power Sums page 105
v
Preliminary version – October 28, 2008
Preliminary version – October 28, 2008
WA R N I N G - U S E A T O W N R I S K
¿is is the solutions manual to the book
. It contains
contributions by (in alphabetical order) Abdelaziz Amraoui, Cyril Méasson, Vish-
wambar Rathi, and Ruediger Urbanke. ¿ese notes are work in progress and change
daily. To get the current version please contact ruediger.urbanke@ep.ch. Contribu-
tions to make this solutions manual more complete and accurate are very welcome.
If you have exercises that you are willing to share with others please send them
to us.
1
Preliminary version – October 28, 2008
modern coding theory
Preliminary version – October 28, 2008