arXiv (All)
open access
Sequence Reconstruction over the Deletion Channel
In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are di
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
- Simple Finite-Length Achievability and Converse Bounds for the Deletion Channel and the Insertion Channel#139156
- Decoding rank metric Reed-Muller codes#153696
- Lossy Joint Source-Channel Coding over Unknown Channels#924586
- Lossy Joint Source-Channel Coding over Unknown Channels#920354
- On the Hamming distance properties of group codes#490073
Record · ID 1049697
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