Table 2.
Performance comparison of Derrick decoding with hard-decision decoding by the number of failed matrices on ONT real datasets.
| RS(255, 211) (#Matrix = 120) | RS(255, 235) (#Matrix = 1600) | RS(255, 241) (#Matrix = 80) | ||||
|---|---|---|---|---|---|---|
| Depth | Hard | Derrick | Hard | Derrick | Hard | Derrick |
| 4× | 78 | 1 | – | – | – | – |
| 5× | 15 | 0 | – | – | – | – |
| 6× | 0 | 0 | 887 | 41 | – | – |
| 7× | 0 | 0 | 229 | 1 | 71 | 10 |
| 8× | 0 | 0 | 31 | 0 | 35 | 0 |
| 9× | 0 | 0 | 1 | 0 | 3 | 0 |
| 10× | 0 | 0 | 0 | 0 | 0 | 0 |
The ‘#Matrix’ displays the total number of matrices used in each decoding test; the ‘Depth’ column represents the sequencing depths; the ‘Hard’ and ‘Derrick’ columns indicate the number of failed matrices observed in tests utilizing the hard-decision decoding strategy and Derrick decoding algorithm, respectively; ‘–’ denotes tests where the number of errors exceeds the soft-decision strategy's capacity, and the result is, therefore, not considered.