Metraipolis › archive › dc_0ce8ab41b083

On Function-Correcting Lee Metric Codes with Data Protection — arXiv:2610.12217

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.12217
License (as archived)
CC0-1.0
Archived
2026-10-09T06:29:37.677Z
SHA-256 of the archived text
3706d4e8e9e4a9e335f820ad8752da74d3e341279626c25ca5c9b52d066076a4
Stable URL of this page
https://metraipolis.com/documento/dc_0ce8ab41b083

How to cite

On Function-Correcting Lee Metric Codes with Data Protection — arXiv:2610.12217 — arXiv (en), https://arxiv.org/abs/2610.12217 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0ce8ab41b083 (Metraipolis archive dc_0ce8ab41b083, sha256 3706d4e8e9e4a9e335f820ad8752da74d3e341279626c25ca5c9b52d066076a4)
BibTeX
@misc{dc0ce8ab41b083,
  title = {On Function-Correcting Lee Metric Codes with Data Protection — arXiv:2610.12217},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.12217},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0ce8ab41b083; sha256 3706d4e8e9e4a9e335f820ad8752da74d3e341279626c25ca5c9b52d066076a4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.12217. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Function-correcting codes are designed to protect the function values of a prescribed function against errors. Every error-correcting code that provides data protection inherently offers some degree of protection for functions defined on the data. In this work, we introduce a class of codes over $\mathbb{Z}_m$, termed function-correcting Lee metric codes with data protection (FCLMCs with data protection), which simultaneously provide error protection for both the data and the corresponding function values under the Lee metric. We consider codes that provide protection against a prescribed level of error for the function values that exceeds the level of protection guaranteed for the underlying data. We present a general construction of these codes and derive lower and upper bounds on the optimal redundancy, including a Plotkin-type lower bound. Furthermore, we derive explicit upper bounds on the redundancy of FCLMCs with data protection for several important classes of functions, including locally binary Lee functions, the Lee weight function, and the modular sum function. Finally, since the Lee metric coincides with the Hamming metric over $\mathbb{Z}_2$, all of our results remain valid over $\mathbb{Z}_2$ with respect to the Hamming metric.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.12217 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T05:54:06.715Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).