A General Plotkin-type Bound on Function-Correcting Codes with Wyner-Graham Distance

@misc{jagatti2026general,
  title = {{A General Plotkin-type Bound on Function-Correcting Codes with Wyner-Graham Distance}},
  author = {Kanchana Lokshmii Jagatti and K. Hareesh and N. T. Rashid Ummer and B. Sundar Rajan},
  howpublished = {arXiv},
  year = {2026},
  month = aug,
  doi = {10.48550/arxiv.2608.29573},
  eprint = {2608.29573},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.29573},
}

TY  - UNPB
TI  - A General Plotkin-type Bound on Function-Correcting Codes with Wyner-Graham Distance
AU  - Kanchana Lokshmii Jagatti
AU  - K. Hareesh
AU  - N. T. Rashid Ummer
AU  - B. Sundar Rajan
PY  - 2026
DA  - 2026/08/30
PB  - arXiv
DO  - 10.48550/arxiv.2608.29573
UR  - https://arxiv.org/abs/2608.29573
AB  - Function correcting codes (FCCs) are designed to protect a specified function evaluation of messages at a higher level than the level of protection for messages, against errors while reducing the redundancy required for reliable communication. FCCs have thus far been studied for channels matched to various distances, including the Hamming and Lee distances. Every function partitions the message space into preimage sets corresponding to its distinct function values. Existing Plotkin-type bounds on the optimal redundancy of FCCs under the studied distances, applicable to arbitrary functions on the message space, depend on the pairwise distances among all the message vectors. This makes these bounds difficult to compute. We derive a general Plotkin-type bound on the optimal redundancy of FCCs under Wyner Graham distances, which include the Hamming and Lee distances as special cases. Our bound depends only on the cardinalities of the preimage sets and the sum of pairwise distances only among vectors within each preimage set. This approach significantly reduces the computations required to evaluate the existing Plotkin-type bounds and yields simplified bounds that are easier to compute for specific functions. We obtain simplified Plotkin-type bound for linear functions under the Wyner-Graham distance. Furthermore, the existing simplified bounds for linear functions under the Hamming and Lee distances are recovered as special cases of the proposed bound. We also obtain simplified bounds for several important classes of functions, including the Hamming weight function, the Hamming weight distribution function, the monomial functions under the Hamming distance, and the modular sum function, the Lee weight function, and the Lee weight distribution function under the Lee distance.
ER  -