arXiv (All)
open access
Insdel Reed-Solomon Decoding Algorithms up to the Half-Singleton Bound
In this paper, we focus on decoding optimal Reed-Solomon codes of dimension two for insdel errors up to the half-Singleton bound. We present a decoding algorithm for the general insertion-and-deletion scenario with a time complexity smaller than brute-force decoding. Our algorithm corrects insdel er
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
- RPA Decoding with Few Subspace Projections for Correcting Structured Error Patterns in RM Codes#1327830
- The Value of Duplicate Measurements When Decoding Second-Order Reed-Muller Codes#1051054
- The Covering Radius of the Reed--Muller Code RM(1,9) is 242#1343072
- Capacity Achieving Torn Paper Codes#984246
- Structured Masked Diffusion for Shared-Codebook Unsourced Random Access Decoding#1344593
Record · ID 1326663
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