N(n,3,4) equals 20n minus 166 for n at least 13, with a matching lower bound shown for all t at least 4 when n is large enough.
Bounds and constructions ofℓ-read codes under the Hamming metric,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Some New Results on Sequence Reconstruction Problem for Deletion Channels
N(n,3,4) equals 20n minus 166 for n at least 13, with a matching lower bound shown for all t at least 4 when n is large enough.