2 problems
- 0 votes0 replies0 views
Regularity characterization conjecture for correctable patterns in tensor-product topologies
Regularity characterization conjecture. An erasure pattern is correctable for if and only if it is regular.
- 0 votes0 replies1 view
Asymptotic strict error-rate SNR gains of tensor-product codes
Let TPPC and single-level LDPC denote the two coding schemes being compared, and let the sector length of each code tend to infinity. Asymptotic TPPC SNR-gain conjecture. As the se…