ECC TOPICS
Search this site
Navigation
Introduction
Blog
Classes of Codes
Historical Overview
Algebraic Codes
Basic Algebraic ECC Concepts
Binary BCH Codes
Binary BCH Design Options
Reed-Solomon (RS) Codes
LDPC and RS Codes
LDPC Codes
Tanner Graphs
LDPC Coding Dilemma
LDPC Decoder Examples
Check Nodes
Bit Nodes
Opinions Regarding LDPC Codes
Outcomes of Decoding
2D-RS Schemes
2D ECC Concepts
2D-RS HDDs
2D-RS SSDs
2D-RS Storage Systems
2D-RS HDD Products
Understanding RS RAID
Mathematics
Finite Fields
Finite Fields with 4-bit Elements
Finite Fields, RS Codes and RS RAID
Hard Disk Drives (HDDs)
Most Important Disk Drive Facts
Cylinder Drive Concepts
Iterative Decoding
Iterative Decoding of 2D-RS Codes
Iterative Decoding of LDPC Codes
Other Topics
Memory System Design
The Danger of Overemphasizing Theory
Important High-Level ECC Design Considerations
Correcting Cell Failures
Questions & Comments
ECC Technologies, Inc. (ECC Tek)
Links
LDPC Codes
>
LDPC Coding Dilemma
On the one hand, cycles in the Tanner graph of a LDPC code degrade decoder performance.
On the other hand, if the Tanner graph of a LDPC code has no cycles, the code has a minimum distance
<
2.