For binary product codes decoded with iBDD-SR, component codes with 3-bit error correction (t=3) give the best performance-complexity trade-off at overheads from 6.25% to 33.33%.
R.: ‘Low-complexity concatenated LDPC-staircase codes’, IEEE/OSA J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2019 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability
For binary product codes decoded with iBDD-SR, component codes with 3-bit error correction (t=3) give the best performance-complexity trade-off at overheads from 6.25% to 33.33%.