Metraipolis › archive › dc_aa09d240930a

Data Protection in Function-Correcting Symbol-Pair Codes: Redundancy Bounds and Protection Profiles — arXiv:2609.10989

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.10989
License (as archived)
CC0-1.0
Archived
2026-10-16T06:20:20.495Z
SHA-256 of the archived text
9543a121f15d85be5304e1342e22a173c006ef482598863097b64b0dd685da6e
Stable URL of this page
https://metraipolis.com/documento/dc_aa09d240930a

How to cite

Data Protection in Function-Correcting Symbol-Pair Codes: Redundancy Bounds and Protection Profiles — arXiv:2609.10989 — arXiv (en), https://arxiv.org/abs/2609.10989 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_aa09d240930a (Metraipolis archive dc_aa09d240930a, sha256 9543a121f15d85be5304e1342e22a173c006ef482598863097b64b0dd685da6e)
BibTeX
@misc{dcaa09d240930a,
  title = {Data Protection in Function-Correcting Symbol-Pair Codes: Redundancy Bounds and Protection Profiles — arXiv:2609.10989},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.10989},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_aa09d240930a; sha256 9543a121f15d85be5304e1342e22a173c006ef482598863097b64b0dd685da6e},
  year = {2026}
}

Archived text

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

In several storage systems, including DNA storage and flash memory, errors affect neighbouring symbols jointly, and the Hamming metric does not adequately capture such error patterns. The symbol-pair read channel, introduced by Cassuto and Blaum~\cite{cassuto2011codes}, addresses this by reading consecutive pairs of symbols rather than individual symbols. Motivated by this, we introduce function-correcting symbol-pair codes with data protection (FCSPC-DP), which guarantee reliable recovery of a desired function of the message while simultaneously protecting the message itself against symbol-pair errors. We derive bounds on the optimal redundancy of such codes and establish a relationship with joint-pair distance matrices. We also give explicit constructions of FCSPC-DP for locally pair-bounded functions and symbol-pair weight functions. We introduce the pair-separation constant of a function, the minimum symbol-pair distance between messages sharing a function value, and show that when it is sufficiently large, data protection requires no additional redundancy: the optimal redundancy coincides with that of the corresponding code without data protection. Considering the symbol-pair analogue of the $\alpha$-distance graph, we introduce two code invariants, the generation profile and the disconnection threshold, and use them to characterise a code's protection properties. Relating the two metrics through these invariants yields upper and lower bounds on the symbol-pair threshold in terms of its Hamming counterpart, both of which are attained. We further extend the classical Plotkin and sphere-packing bounds to this setting.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.10989 — 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-16T06:01:23.671Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).