PreprintCC BY 4.0arXiv
On systematicity of linear function-correcting codes
Abstract
The standard formulation of function-correcting codes uses systematic encodings. We study the redundancy cost of this constraint when both the prescribed function and the encoding are linear. We introduce the function-separation distance and show that several classical unequal error protection parameters are special cases. For linear functions and encodings, this distance is the first relative generalized Hamming weight of the code relative to the encoded kernel. We formulate free and systematic linear separation problems. We prove that the optimal free redundancy depends only on the rank of the function, and determine the optimal systematic redundancy for prescribed separations d≤3.
Related
- On Optimal Encodings and Systematicity in Function-Correcting Codes
- Plotkin-type Bound on Function-Correcting Codes for Monomial Mappings
- On Function-Correcting Lee Metric Codes with Data Protection
- Data Protection in Function-Correcting Symbol-Pair Codes: Redundancy Bounds and Protection Profiles
- Generalized Function-Correcting Partition Codes: Bounds and constructions
BibTeX
@misc{ho2026systematicity,
title = {{On systematicity of linear function-correcting codes}},
author = {Duy Ho},
howpublished = {arXiv},
year = {2026},
month = aug,
doi = {10.48550/arxiv.2608.29389},
eprint = {2608.29389},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.29389},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - On systematicity of linear function-correcting codes
AU - Duy Ho
PY - 2026
DA - 2026/08/29
PB - arXiv
DO - 10.48550/arxiv.2608.29389
UR - https://arxiv.org/abs/2608.29389
AB - The standard formulation of function-correcting codes uses systematic encodings. We study the redundancy cost of this constraint when both the prescribed function and the encoding are linear. We introduce the function-separation distance and show that several classical unequal error protection parameters are special cases. For linear functions and encodings, this distance is the first relative generalized Hamming weight of the code relative to the encoded kernel. We formulate free and systematic linear separation problems. We prove that the optimal free redundancy depends only on the rank of the function, and determine the optimal systematic redundancy for prescribed separations d≤3.
ER -