Fundamentals of Codes, Graphs, and Iterative Decoding

Overview

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

See more details below
Paperback (Softcover reprint of the original 1st ed. 2002)
$125.75
BN.com price
(Save 15%)$149.00 List Price
Other sellers (Paperback)
  • All (4) from $138.50   
  • New (3) from $138.50   
  • Used (1) from $188.20   
Sending request ...

Overview

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.

Read More Show Less

Product Details

Table of Contents

List of Figures. List of Tables. Preface. 1: Digital Communication. 1. Basics. 2. Algorithms and Complexity. 3. Encoding and Decoding. 4. Bounds. 5. Overview of the Text. 2: Abstract Algebra. 1. Sets and Groups. 2. Rings, Domains, and Fields. 3. Vector Spaces and GF(pm). 4. Polynomials over Galois Fields. 5. Frequency Domain Analysis of Polynomials over GF(q) [x]/(xn-1). Linear Block Codes. 1. Basic Structure of Linear Codes. 2. Repetition and Parity Check Codes. 3. Hamming Codes. 4. Reed-Muller Codes. 5. Cyclic Codes. 6. Quadratic Residue Codes. 7. Golay Codes. 8. BCH and Reed-Solomon Codes. 4: Convolutional and Concatenated Codes. 1. Convolutional Encoders. 2. Analysis of Component Codes. 3. Concatenated Codes. 4. Analysis of Parallel Concatenated Codes. 5: Elements of Graph Theory. 1. Introduction. 2. Martingales. 3. Expansion. 6: Algorithms on Graphs. 1. Probability Models and Bayesian Networks. 2. Belief Propagation Algorithm. 3. Junction Tree Propagation Algorithm. 4. Message Passing and Error Control Decoding. 5. Message Passing in Loops. 7: Turbo Decoding. 1. Turbo Decoding. 2. Parallel Decoding. 3. Notes. 8: Low-Density Parity-Check Codes. 1. Basic Properties. 2. Simple Decoding Algorithms. 3. Explicit Construction. 4. Gallager's Decoding Algorithms. 5. Belief Propagation Decoding. 6. Notes. 9: Low-Density Generator Codes. 1. Introduction. 2. Decoding Analyses. 3. Good Degree Sequences. 4. Irregular Repeat-Accumulate Codes. 5. Cascaded Codes. 6. Notes. References. Index.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)