{
  "abstract": "Accurate first erroneous position (FEP) identification is key to improving the error-correction performance of successive cancellation flip (SCF) decoding. However, FEP identification remains challenging with a limited number of re-decoding attempts. To address this issue, we propose decision-boundary normalization (DBN) to improve FEP identification and develop a novel DBN-SCF decoding algorithm. DBN normalizes the magnitude of each decision log-likelihood ratio (LLR) by the standard deviation predicted by the Gaussian approximation (GA) for the corresponding bit-channel. This allows a single normalized threshold to be shared across bit-channels within each code configuration, giving it a consistent statistical meaning and avoiding per-channel calibration. DBN-SCF decoding selects candidate flip positions from the information set in the natural successive cancellation (SC) decoding order using a threshold, without sorting. Moreover, DBN-SCF decoding achieves better error-correction performance with a limited number of re-decoding attempts. It also requires lower average decoding complexity than existing SCF decoding methods at a comparable level of error-correction performance.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2611.10846",
  "author_total": 6,
  "authors": [
    {
      "name": "Gulinisha Yiming"
    },
    {
      "name": "Zhongjun Yang"
    },
    {
      "name": "Zhicheng Liu"
    },
    {
      "name": "Zhiming Ma"
    },
    {
      "name": "Xumin Ni"
    },
    {
      "name": "Yuting Liu"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/09k1zw1yhag8z.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2611.10846",
  "fulltext_url": null,
  "id": "09k1zw1yhag8z",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2611.10846",
  "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": null,
  "pdf_url": "https://arxiv.org/pdf/2611.10846",
  "pmcid": null,
  "pmid": null,
  "published": "2026-11-07",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/09k1zw1yhag8z.ris",
  "sources": [
    {
      "first_seen": "2026-11-10T06:21:33Z",
      "native_id": "2611.10846",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2611.10846"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.IT",
      "subfield": "general"
    }
  ],
  "title": "Efficient SC-Flip Decoding for Polar Codes through Decision-Boundary Normalization",
  "title_text": "Efficient SC-Flip Decoding for Polar Codes through Decision-Boundary Normalization",
  "type": "preprint",
  "updated_at": "2026-11-10T06:21:33Z",
  "url": "https://research.draconitic.com/paper/09k1zw1yhag8z",
  "venue": "arXiv",
  "versions": []
}