arXiv (All)
open access
Order-Optimal Systematic Permutation Codes for Correcting t Deletions
This paper investigates the construction of full-systematic permutation codes capable of correcting multiple deletions under two complementary models, namely symbol-invariant deletions (SIDs), where surviving symbol values are preserved, and permutation-invariant deletions (PIDs), where the survivin
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
- Monotone Erasure Codes#216781
- Bounds on Codes Correcting Adjacent Transpositions#609817
- Coding for Multiple Reverse-Complement and Palindromic Duplications#820790
- Improved Johnson-type Bounds for Insertion-Deletion Codes#615029
- Improved Johnson-type Bounds for Insertion-Deletion Codes#614062
Record · ID 1141895
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