{
  "annotation_id": "81255823-9629-4bc5-a4ee-441767e98189",
  "date_created": "2026-02-17T05:53:23.342000Z",
  "date_modified": "2026-02-17T05:53:23.342000Z",
  "file_hash": "2e0758113a5fe886909c68c73c1e0e2d7e09448ba2845bb104cddb2c51866530",
  "private": false,
  "record": {
    "abstract": "Distributed storage systems must handle both data heterogeneity, arising from non-uniform access demands, and device heterogeneity, caused by time-varying node reliability. In this paper, we study convertible codes, which enable the transformation of one code into another with minimum cost in the merge regime, addressing the latter. We derive general lower bounds on the read and write costs of linear code conversion, applicable to arbitrary linear codes. We then focus on Reed-Muller codes, which efficiently handle data heterogeneity, addressing the former issue, and construct explicit conversion procedures that, for the first time, combine both forms of heterogeneity for distributed data storage.",
    "arxiv_id": "2601.10341",
    "authors": [
      "Anina Gruica",
      "Benjamin Jany",
      "Stanislav Kruglik"
    ],
    "categories": [
      "cs.IT",
      "math.IT"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "title": "Convertible Codes for Data and Device Heterogeneity",
    "url": "https://arxiv.org/abs/2601.10341",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "75a3a95f-9f31-4f93-9bad-2eb87e9132a0",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}