Graph-Based Codes and Iterative Decoding
<p>The field of error correcting codes was revolutionized by the introduction of turbo codes in 1993. These codes demonstrated dramatic performance improvements over any previously known codes, with significantly lower complexity. Since then, much progress has been made towards understanding t...
Main Author: | Khandekar, Aamod Dinkar |
---|---|
Format: | Others |
Language: | en |
Published: |
2003
|
Online Access: | https://thesis.library.caltech.edu/2652/1/thesis.pdf Khandekar, Aamod Dinkar (2003) Graph-Based Codes and Iterative Decoding. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/Q06G-MW38. https://resolver.caltech.edu/CaltechETD:etd-06202002-170522 <https://resolver.caltech.edu/CaltechETD:etd-06202002-170522> |
Similar Items
-
Iterative Decoding of Codes on Graphs
by: Sankaranarayanan, Sundararajan
Published: (2006) -
Iterative decoding of codes defined on graphs
by: Reznik, Alexander, 1974-
Published: (2005) -
Compound codes based on irregular graphs and their iterative decoding.
Published: (2011) -
Iterative decoding methods based on low-density graphs
by: Paolini, Enrico <1977>
Published: (2007) -
Iterative decoding of product codes
by: Al-Askary, Omar
Published: (2003)