arXiv (All)
open access
Random Algebraic Geometry Codes Approach the Half-Singleton Bound for Insertions and Deletions
In this paper, we study the performance of algebraic geometry (AG) codes against adversarial insertion-deletion (insdel) errors. The half-Singleton bound states that an $[n,k]_q$ linear code can correct at most $n-2k+1$ insdel errors. It was recently proven that random Reed-Solomon codes approach th
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
- Algebraic Geometry Codes Approach the Half-Singleton Bound with Constant Field Size#971974
- Elevator Codes: Concatenation for resource-efficient quantum memory under biased noise#1050804
- Exponential Correlation Bounds for Polynomials#1076495
- A Polynomial-Time Attack on the McEliece Cryptosystem on Elliptic Codes with Arbitrary Divisors#1011456
- Systematic Codes Correcting Two Deletions with Three Redundant Symbols over Large Alphabets#1142860
Record · ID 974018
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