Journal article · 2026 · Open access
Function-Correcting Codes With Data Protection
IEEE Transactions on Information Theory, 72(7), 4860–4880 · Published 12 May 2026 · DOI 10.1109/tit.2026.3692458
In brief
“Function-Correcting Codes With Data Protection” is a 2026 journal article by Charul Rajput and 3 co-authors, published in IEEE Transactions on Information Theory. OpenAlex counts 16 citations as of 17 November 2026, which puts it in the top 2% of works published in 2026 by citations. It is open access under a CC BY licence: the full text is free to read at IEEE Transactions on Information Theory.
- Citations
- 16
- Most cited in
- 2026 (16)
- Field-weighted impact
- 18.75
- Authors
- 4
Abstract
Function-correcting codes (FCCs) are designed to provide error protection for the value of a function computed on the data. Existing work typically focuses solely on protecting the function value and not the underlying data. In this work, we propose a general framework that offers protection for both the data and the function values. Since protecting the data inherently contributes to protecting the function value, we focus on scenarios where the function value requires stronger protection than the data itself. A two-step construction procedure for such codes is proposed, and bounds on the optimal redundancy of general FCCs with data protection are reported. Using these results, we exhibit examples that show that data protection can be added to existing FCCs without increasing redundancy. Using our two-step construction procedure, we present explicit constructions of FCCs with data protection for specific families of functions, such as locally bounded functions and the Hamming weight function. We associate a graph calledminimum-distance graphto a code and use it to show that perfect codes and maximum distance separable (MDS) codes cannot provide additional protection to function values over and above the amount of protection for data for any function. Then we focus on linear FCCs and provide some results for linear functions, leveraging their inherent structural properties. While FCCs for linear functions have been considered earlier in the literature, to the best of our knowledge, the linearity of the FCC itself has not been studied before. Finally, we generalize the Plotkin and Hamming bounds well known in classical error-correcting coding theory to FCCs with data protection.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Rajput, C., Rajan, B. S., Freij-Hollanti, R., & Hollanti, C. (2026). Function-Correcting Codes With Data Protection. IEEE Transactions on Information Theory, 72(7), 4860–4880. https://doi.org/10.1109/tit.2026.3692458
MLA 9
Rajput, Charul, et al. “Function-Correcting Codes With Data Protection.” IEEE Transactions on Information Theory, vol. 72, no. 7, 2026, pp. 4860–4880. https://doi.org/10.1109/tit.2026.3692458.
Chicago
Rajput, Charul, Balaji Sundar Rajan, Ragnar Freij-Hollanti, and Camilla Hollanti. 2026. “Function-Correcting Codes With Data Protection.” IEEE Transactions on Information Theory 72 (7): 4860–4880. https://doi.org/10.1109/tit.2026.3692458.
Harvard
Rajput, C. et al. (2026) ‘Function-Correcting Codes With Data Protection’, IEEE Transactions on Information Theory, 72(7), pp. 4860–4880. doi:10.1109/tit.2026.3692458.
IEEE
C. Rajput, B. S. Rajan, R. Freij-Hollanti, and C. Hollanti, “Function-Correcting Codes With Data Protection,” IEEE Transactions on Information Theory, vol. 72, no. 7, pp. 4860–4880, 2026, doi: 10.1109/tit.2026.3692458.
BibTeX
@article{rajput2026function,
title = {{Function-Correcting Codes With Data Protection}},
author = {Rajput, Charul and Rajan, Balaji Sundar and Freij-Hollanti, Ragnar and Hollanti, Camilla},
journal = {IEEE Transactions on Information Theory},
year = {2026},
volume = {72},
number = {7},
pages = {4860--4880},
doi = {10.1109/tit.2026.3692458},
url = {https://doi.org/10.1109/tit.2026.3692458}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- data protection
- redundancy bounds
- locally bounded functions
- perfect codes
- MDS codes
- linear functions
- Plotkin bound
- Hamming bound
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
Rajput, C., Rajan, B. S., Freij-Hollanti, R., & Hollanti, C. (2026). Function-Correcting Codes With Data Protection. IEEE Transactions on Information Theory, 72(7), 4860–4880. https://doi.org/10.1109/tit.2026.3692458
How many times has this paper been cited?
16 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at IEEE Transactions on Information Theory: sign in and open the full text from this page.
Who wrote this paper?
Charul Rajput, Balaji Sundar Rajan, Ragnar Freij-Hollanti, Camilla Hollanti.
What is the DOI of this paper?
10.1109/tit.2026.3692458, permanently at https://doi.org/10.1109/tit.2026.3692458. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.