arXiv (OAI Expanded)
open access
On Sequence Reconstruction Problem for q-ary Deletion Channels
The sequence reconstruction problem for $q$-ary deletion channels, introduced by Levenshtein in 2001, concerns the minimum number of channels required to uniquely recover a transmitted sequence when each channel introduces exactly $t$ deletions. Combinatorially, it is equivalent to determining $N_q(
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Bath dimension and initial entropy for closed repeated use of a quantum channel#1012463
- Purification brings advantages in sequential quantum channel discrimination#1154481
- An Askey-Type Confluence Scheme for Hahn-Like Multiple Orthogonality#985443
- On a conjecture due to Kanade related to Nahm sums#821793
- Weighted averages and applications to sets of multiple recurrence#1122579
Record · ID 1122831
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive