{
  "abstract": "We derive an upper bound on the rate of a linear code capable of list decoding from insertion and deletion errors. Subsequently, we show that a linear code can list decode from at most $n - \\frac{L}{L+1}k + 1$ insdel errors with fixed list size $L$, and that this bound is strict when the code does not contain the all-ones vector. We also provide a simple construction of codes achieving the optimal rate for any given list size capable of correcting a single insdel error. All the results hold for linear codes over finite fields of size $q \\geq 3$.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.23270",
  "author_total": 3,
  "authors": [
    {
      "name": "Neehar Verma"
    },
    {
      "name": "Camilla Hollanti"
    },
    {
      "name": "Razane Tajeddine"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/2vy8dysfqwq5v.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.23270",
  "fulltext_url": null,
  "id": "2vy8dysfqwq5v",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.23270",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.IT"
    ],
    [
      "arxiv",
      "math.CO"
    ],
    [
      "arxiv",
      "math.IT"
    ],
    [
      "openalex",
      "1702|Coding theory and cryptography"
    ]
  ],
  "openalex": "W7222914174",
  "pdf_url": "https://arxiv.org/pdf/2610.23270",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-16",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/2vy8dysfqwq5v.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:30:37Z",
      "native_id": "2610.23270",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.23270"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "A Generalized Half-Singleton Bound for List Decoding of Insertion/Deletion Errors",
  "title_text": "A Generalized Half-Singleton Bound for List Decoding of Insertion/Deletion Errors",
  "type": "preprint",
  "updated_at": "2026-10-30T12:33:31Z",
  "url": "https://research.draconitic.com/paper/2vy8dysfqwq5v",
  "venue": "arXiv",
  "versions": []
}