{
  "annotation_id": "2e430b22-838f-472e-9c7a-6a33a72265f9",
  "date_created": "2026-02-17T05:53:20.463000Z",
  "date_modified": "2026-02-17T05:53:20.463000Z",
  "file_hash": "c48d820acd1c3b544ef381d04161e29f6506e55cf981b165375f38f49ff671e3",
  "private": false,
  "record": {
    "abstract": "We consider the problem of minimizing the index of coincidence of a joint distribution under fixed marginal constraints. This objective is motivated by several applications in information theory, where the index of coincidence naturally arises. A closed-form solution is known when the marginals satisfy a strong feasibility condition, but this condition is rarely met in practice. We first show that the measure of the set of marginals for which condition applies vanishes as the dimension grows. We then characterize the structure of the optimal coupling in the general case, proving that it exhibits a monotone staircase of zero entries. Based on this structure, we propose an explicit iterative construction and prove that it converges in finitely many steps to a minimizer. Main result of the paper is a complete constructive solution of index-of-coincidence minimization.",
    "arxiv_id": "2601.09347",
    "authors": [
      "Pierre Jean-Claude Robert Bertrand"
    ],
    "categories": [
      "cs.IT",
      "math.IT",
      "math.ST",
      "stat.TH"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "A Constructive Method to Minimize the Index of Coincidence under Marginal Constraints",
    "url": "https://arxiv.org/abs/2601.09347",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "eb3ffbea-599d-4657-a147-0d7893799bcd",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}