{
  "annotation_id": "b7244c6c-97c8-4965-8f1f-474333d95a82",
  "date_created": "2026-02-17T05:53:23.801000Z",
  "date_modified": "2026-02-17T05:53:23.801000Z",
  "file_hash": "5080c36d185a3bcedd6d36fb65835e09b4756b64336202dcb381b768669a8914",
  "private": false,
  "record": {
    "abstract": "Function-Correcting Codes (FCCs) enable reliable computation of a function of a $k$-bit message over noisy channels without requiring full message recovery. In this work, we study optimal single-error correcting FCCs (SEFCCs) for maximally-unbalanced Boolean functions, where $k$ denotes the message length and $t$ denotes the error-correction capability. We analyze the structure of optimal SEFCC constructions through their associated codeword distance matrices and identify distinct FCC classes based on this structure. We then examine the impact of these structural differences on error performance by evaluating representative FCCs over the additive white Gaussian noise (AWGN) channel using both soft-decision and hard-decision decoding. The results show that FCCs with different distance-matrix structures can exhibit markedly different Data BER and function error behavior, and that the influence of code structure depends strongly on the decoding strategy.",
    "arxiv_id": "2601.10135",
    "authors": [
      "Rajlaxmi Pandey",
      "Shiven Bajpai",
      "Anjana A Mahesh",
      "B. Sundar Rajan"
    ],
    "categories": [
      "cs.IT",
      "math.IT"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Function Correcting Codes for Maximally-Unbalanced Boolean Functions",
    "url": "https://arxiv.org/abs/2601.10135",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ff4a1d96-e2c4-4a38-b6be-ea078de500e6",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}