{
  "annotation_id": "30c59adc-2a2f-47fe-abba-b0aa92fcbb63",
  "date_created": "2026-02-17T05:53:20.352000Z",
  "date_modified": "2026-02-17T05:53:20.352000Z",
  "file_hash": "ce903c8981f45b03f14fc0884ad1a2bef1c9c331d21f029269b7896c614ce912",
  "private": false,
  "record": {
    "abstract": "This paper studies random-coding error exponents of randomised list decoding, in which the decoder randomly selects $L$ messages with probabilities proportional to the decoding metric of the codewords. The exponents (or bounds) are given for mismatched, and then particularised to matched and universal decoding metrics. Two regimes are studied: for fixed list size, we derive an ensemble-tight random-coding error exponent, and show that, for the matched metric, it does not improve the error exponent of ordinary decoding. For list sizes growing exponentially with the block-length, we provide a non-trivial lower bound to the error exponent that is tight at high rates under the matched metric.",
    "arxiv_id": "2601.09519",
    "authors": [
      "Henrique K. Miyamoto",
      "Sheng Yang"
    ],
    "categories": [
      "cs.IT",
      "math.IT"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Error Exponents for Randomised List Decoding",
    "url": "https://arxiv.org/abs/2601.09519",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "41905af9-fe04-43ce-8abc-308067dc64f4",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}