Metraipolis › archive › dc_a8e90af36636
Plotkin-type Bound on Function-Correcting Codes for Monomial Mappings — arXiv:2610.04546
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.04546
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T16:58:55.832Z
- SHA-256 of the archived text
f7682ea9e71b821582dfea42fb17e6c42784b37af13686492df3b7e537f69f07- Stable URL of this page
https://metraipolis.com/documento/dc_a8e90af36636
How to cite
Plotkin-type Bound on Function-Correcting Codes for Monomial Mappings — arXiv:2610.04546 — arXiv (en), https://arxiv.org/abs/2610.04546 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a8e90af36636 (Metraipolis archive dc_a8e90af36636, sha256 f7682ea9e71b821582dfea42fb17e6c42784b37af13686492df3b7e537f69f07)
BibTeX
@misc{dca8e90af36636,
title = {Plotkin-type Bound on Function-Correcting Codes for Monomial Mappings — arXiv:2610.04546},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.04546},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a8e90af36636; sha256 f7682ea9e71b821582dfea42fb17e6c42784b37af13686492df3b7e537f69f07},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.04546. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Function-correcting codes, recently introduced by Lenz et al.\ (2023), provide a framework for the receiver to provide a higher level of protection against channel errors than the level of protection for messages. In this paper, we derive a generalised Plotkin-type bound on the redundancy of FCCs under the Hamming metric for arbitrary functions over finite fields. The proposed bound recovers the classical Plotkin bound for classical error-correcting codes as a special case. We further obtain explicit Plotkin-type bounds for linear functions, Hamming-weight functions, and Hamming-weight threshold functions. In addition, we study FCCs for monomial mappings $f(x)=x^n$ over $\mathbb{F}_{q^k}$, which are widely utilised in coding theory, cryptography, and finite geometry, and derive an explicit Plotkin-type redundancy bound.
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.04546 — 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-06T15:24:20.157Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).