Skip to content
Open global navigation

Cambridge University Press

AcademicLocation selectorSearch toggleMain navigation toggle
Cart
Register Sign in Wishlist

Modern Coding Theory

$104.00 (Z)

  • Date Published: March 2008
  • availability: In stock
  • format: Hardback
  • isbn: 9780521852296

$104.00 (Z)
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
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: www.cambridge.org/9780521852296.

    • 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

    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: March 2008
    • format: Hardback
    • isbn: 9780521852296
    • length: 590 pages
    • dimensions: 254 x 178 x 32 mm
    • weight: 1.23kg
    • contains: 150 b/w illus. 185 exercises
    • availability: In stock
  • Table of Contents

    Preface
    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.

  • general resources

    View all resources
    Group Section Name Type Size Sort Order filter vars
    General ResourcesFiguresFigurespdf2337KB0figures general resources figures general resourcesfigures
    General ResourcesSolutionsSolutions Manualpdf760KB1solutions general resources solutions general resourcessolutions

    This title has a locked file and access is given only to instructors adopting the textbook for their class. We need to strictly enforce this so that solutions are not made available to students. To gain access to locked resources you need to first log in with your Cambridge account details and then return to this page to submit details of your course so you can be authenticated as an instructor. Click here to log in. If you do not have a Cambridge account you will first need to click here to create an account and then return to this page to be authenticated.


    These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.

    If you are having problems accessing these resources please email cflack@cambridge.org

  • Authors

    Tom Richardson
    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.

    Ruediger 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

Cancel

Not already registered? Create an account now. ×

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

Continue ×

Continue ×

Find content that relates to you

Join us online

© Cambridge University Press 2014

Back to top

Are you sure you want to delete your account?

This cannot be undone.

Cancel Delete

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.
×