dorsal/arxiv
View SchemaOn the Sequence Reconstruction Problem for the Single-Deletion Two-Substitution Channel
| Authors | Wentu Song, Kui Cai, Tony Q. S. Quek |
|---|---|
| Categories | |
| ArXiv ID | 2601.07547vv2 |
| URL | https://arxiv.org/abs/2601.07547 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
The Levenshtein sequence reconstruction problem studies the reconstruction of a transmitted sequence from multiple erroneous copies of it. A fundamental question in this field is to determine the minimum number of erroneous copies required to guarantee correct reconstruction of the original sequence. This problem is equivalent to determining the maximum possible intersection size of two error balls associated with the underlying channel. Existing research on the sequence reconstruction problem has largely focused on channels with a single type of error, such as insertions, deletions, or substitutions alone. However, relatively little is known for channels that involve a mixture of error types, for instance, channels allowing both deletions and substitutions. In this work, we study the sequence reconstruction problem for the single-deletion two-substitution channel, which allows one deletion and at most two substitutions applied to the transmitted sequence. Specifically, we prove that if two $q$-ary length-$n$ sequences have the Hamming distance $d\geq 2$, where $q\geq 2$ is any fixed integer, then the intersection size of their error balls under the single-deletion two-substitution channel is upper bounded by $(q^2-1)n^2-(3q^2+5q-5)n+O_q(1)$, where $O_q(1)$ is a constant independent from $n$ but dependent on $q$. Moreover, we show that this upper bound is tight up to an additive constant.
{
"annotation_id": "ea7308fc-add6-40d1-a17a-7c0413552a7e",
"date_created": "2026-02-17T05:53:12.642000Z",
"date_modified": "2026-02-17T05:53:12.642000Z",
"file_hash": "924e8d6b592b3c1bbf2dc9f0597b9f94bd801a173409f8d16dff26b654a587c5",
"private": false,
"record": {
"abstract": "The Levenshtein sequence reconstruction problem studies the reconstruction of a transmitted sequence from multiple erroneous copies of it. A fundamental question in this field is to determine the minimum number of erroneous copies required to guarantee correct reconstruction of the original sequence. This problem is equivalent to determining the maximum possible intersection size of two error balls associated with the underlying channel. Existing research on the sequence reconstruction problem has largely focused on channels with a single type of error, such as insertions, deletions, or substitutions alone. However, relatively little is known for channels that involve a mixture of error types, for instance, channels allowing both deletions and substitutions. In this work, we study the sequence reconstruction problem for the single-deletion two-substitution channel, which allows one deletion and at most two substitutions applied to the transmitted sequence. Specifically, we prove that if two $q$-ary length-$n$ sequences have the Hamming distance $d\\geq 2$, where $q\\geq 2$ is any fixed integer, then the intersection size of their error balls under the single-deletion two-substitution channel is upper bounded by $(q^2-1)n^2-(3q^2+5q-5)n+O_q(1)$, where $O_q(1)$ is a constant independent from $n$ but dependent on $q$. Moreover, we show that this upper bound is tight up to an additive constant.",
"arxiv_id": "2601.07547",
"authors": [
"Wentu Song",
"Kui Cai",
"Tony Q. S. Quek"
],
"categories": [
"cs.IT",
"math.IT"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "On the Sequence Reconstruction Problem for the Single-Deletion Two-Substitution Channel",
"url": "https://arxiv.org/abs/2601.07547",
"version": "v2"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "51c54ba9-0c17-4f82-9633-efb4886aa4eb",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}