For the multiple-burst substitution channel, the paper shows that error-correction capability, the read-count exponent, and the list-size exponent can be traded freely, with t-1 = epsilon + rho + lambda.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels
For the multiple-burst substitution channel, the paper shows that error-correction capability, the read-count exponent, and the list-size exponent can be traded freely, with t-1 = epsilon + rho + lambda.