{
  "abstract": "In this paper, we focus on decoding MDS linear block codes for insdel errors. Building on our recent work for two-dimensional Reed-Solomon codes, we present a decoding algorithm for bounded distance decoding for the general insertion-and-deletion scenario that can be used for any MDS code of rate at most half. Our algorithm employs a sliding window and has a time complexity smaller than brute-force decoding. In particular, for optimal Reed-Solomon codes, it corrects insdel errors up to the half-Singleton bound, which exceeds the scope of existing methods. Additionally, for the special cases of insertion-only and deletion-only insdel error patterns, we present two different algorithms with a time complexity smaller than our general algorithm.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.34511",
  "author_total": 3,
  "authors": [
    {
      "name": "Bencheng Fan"
    },
    {
      "name": "Margreta Kuijper"
    },
    {
      "name": "Jingge Zhu"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/03b3jyw506vz9.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.34511",
  "fulltext_url": null,
  "id": "03b3jyw506vz9",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.34511",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.IT"
    ],
    [
      "arxiv",
      "math.IT"
    ],
    [
      "openalex",
      "1702|Coding theory and cryptography"
    ]
  ],
  "openalex": "W7223860431",
  "pdf_url": "https://arxiv.org/pdf/2610.34511",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-25",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/03b3jyw506vz9.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:35:40Z",
      "native_id": "2610.34511",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.34511"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.IT",
      "subfield": "general"
    }
  ],
  "title": "Insdel Decoding Algorithms for Maximum Distance Separable Codes",
  "title_text": "Insdel Decoding Algorithms for Maximum Distance Separable Codes",
  "type": "preprint",
  "updated_at": "2026-10-30T12:35:40Z",
  "url": "https://research.draconitic.com/paper/03b3jyw506vz9",
  "venue": "arXiv",
  "versions": []
}