{
  "abstract": "We study adaptive prefix-length selection for reliability-ordered coded transmission over $N$ coordinates, using only the $K$ most reliable, to balance age of information (AoI) against throughput. An additive-increase/decrease (AID) prefix-walk controller updates the prefix length from the last decoding outcome alone, at $O(1)$ per-slot cost with no channel estimation, inducing an irreducible birth--death chain whose mean drift fixes a unique balance point $K^\\dagger$ (largest $K$ with success probability $\\ge\\tfrac12$), around which the stationary distribution concentrates geometrically. We derive this distribution in closed form via detailed balance and obtain exact steady-state AoI and goodput via renewal-reward analysis. Simulations on a $64$-coordinate polar code over a binary symmetric channel (BSC) confirm these predictions to within $0.3\\%$. Relative to a genie-aided upper bound with perfect channel knowledge, we further quantify the goodput cost of adapting from a single feedback bit alone.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.27593",
  "author_total": 1,
  "authors": [
    {
      "name": "Hassan Tavakoli"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/1wc394c9v79v8.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.27593",
  "fulltext_url": null,
  "id": "1wc394c9v79v8",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.27593",
  "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",
      "1705|Age of Information Optimization"
    ]
  ],
  "openalex": "W7223112546",
  "pdf_url": "https://arxiv.org/pdf/2610.27593",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-20",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/1wc394c9v79v8.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:34:08Z",
      "native_id": "2610.27593",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.27593"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.IT",
      "subfield": "general"
    }
  ],
  "title": "AoI-Aware Polar Code Blind Rate Adaptation",
  "title_text": "AoI-Aware Polar Code Blind Rate Adaptation",
  "type": "preprint",
  "updated_at": "2026-10-30T12:34:08Z",
  "url": "https://research.draconitic.com/paper/1wc394c9v79v8",
  "venue": "arXiv",
  "versions": []
}