Skip to content
Register Sign in Wishlist

Modern Coding Theory


  • Date Published: May 2008
  • availability: Available
  • format: Hardback
  • isbn: 9780521852296

£ 74.99

Add to cart Add to wishlist

Other available formats:

Looking for an inspection copy?

This title is not currently available on inspection

Product filter button
About the Authors
  • 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:

    • Helps you to decide which coding scheme to employ, how to design a new scheme and how to improve an existing system
    • Emphasis is on the underlying theory so that the reader develops an intuitive understanding
    • Provides a comprehensive description of turbo codes and iterative codes (including LDPC codes) over the binary erasure channel
    Read more

    Reviews & endorsements

    'There is definitely a market for a book focusing on LDPC codes, and Tom Richardson and Reudiger Urbanke would be on anyone's short list to write that book. They have made substantive contributions to the theory and practice of LDPC codes. I believe this book will become required reading for researchers in LDPC codes at universities and communications companies around the world.' Thomas Fuja, University of Notre Dame

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: May 2008
    • format: Hardback
    • isbn: 9780521852296
    • length: 590 pages
    • dimensions: 259 x 183 x 36 mm
    • weight: 1.22kg
    • contains: 150 b/w illus. 185 exercises
    • availability: Available
  • Table of Contents

    1. Introduction
    2. Factor graphs
    3. Binary erasure channel
    4. Binary memoryless symmetric channels
    5. General channels
    6. Convolutional codes and turbo codes
    7. General ensembles
    8. Expander codes and the flipping algorithm
    Appendices: A. Encoding low-density parity-check codes
    B. Efficient implementation of density evolution
    C. Concentration inequalities
    D. Formal power sums.

  • Resources for

    Modern Coding Theory

    Tom Richardson, Rüdiger Urbanke

    General Resources

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.

    Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.

    Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.

    If you are having problems accessing these resources please contact

  • Authors

    Tom Richardson, Qualcomm, Inc.
    Tom Richardson is Vice President and Chief Scientist at Flarion Technologies, Inc., New Jersey. He was awarded his Ph.D. in electrical engineering in 1990 from M.I.T., after which he worked for 10 years at the Bell Labs' Mathematical Sciences Research Center. He is the inventor of over 20 patents.

    Rüdiger Urbanke, École Polytechnique Fédérale de Lausanne
    Rüdiger Urbanke is a professor in the School of Computer and Communication Sciences at the Ecole Polytechnique Fédérale de Lausanne, Switzerland (EPFL). He was awarded his Ph.D. in electrical engineering in 1995 from Washington University, after which he worked for Bell Labs until joining the faculty at EPFL in 1999. He is currently on the board for the 'Foundations and Trends in Communications and Information Theory' series for the IEEE.

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.