Constant L1-weight codes under L∞-metric
This paper studies the construction of constant-weight codes under-metric, which could be
used to design codes addressing 0-indels (ie, the insertion/deletion of 0's only). Based on …
used to design codes addressing 0-indels (ie, the insertion/deletion of 0's only). Based on …
[HTML][HTML] Some New Constructions of q-ary Codes for Correcting a Burst of at Most t Deletions
In this paper, we construct q-ary codes for correcting a burst of at most t deletions, where t,
q≥ 2 are arbitrarily fixed positive integers. We consider two scenarios of error correction: the …
q≥ 2 are arbitrarily fixed positive integers. We consider two scenarios of error correction: the …
New Construction of -ary Codes Correcting a Burst of at most Deletions
W Song, K Cai - arxiv preprint arxiv:2401.05859, 2024 - arxiv.org
In this paper, for any fixed integer $ q> 2$, we construct $ q $-ary codes correcting a burst of
at most $ t $ deletions with redundancy $\log n+ 8\log\log n+ o (\log\log n)+\gamma_ {q, t} …
at most $ t $ deletions with redundancy $\log n+ 8\log\log n+ o (\log\log n)+\gamma_ {q, t} …