Existence and Constructions of Strict Function-Correcting Codes with Data Protection

TL;DR

This paper investigates the existence and construction of strict function-correcting codes with data protection, providing graph-theoretic conditions and new code constructions, including chain codes and BCH-based codes.

Contribution

It establishes a graph-theoretic existence condition for strict function-correcting codes and introduces new code constructions, such as chain codes and BCH-based codes.

Findings

The distance graph for linear codes is isomorphic to a Cayley graph, linking existence to subcode generation.

Any linear code can be transformed into one with basis of minimum-weight codewords under certain conditions.

Constructed strict function-correcting codes from chain codes and BCH codes with specific properties.

Abstract

Function-correcting codes with data protection simultaneously protect both the data and a function of the data at distinct error-correction levels. When the function receives strictly stronger protection than the data, such a code is called a strict function-correcting code with data protection. While prior work showed that perfect and MDS codes cannot serve as strict function-correcting codes, which codes can serve this role, and how to construct them, has remained open. In this paper, we address the existence and construction of strict function-correcting codes for linear codes through three main contributions. First, using the $\alpha$-distance graph framework from our prior work, we establish a graph-theoretic existence condition under which a code can serve as a strict function-correcting code. For linear codes, we prove this distance graph is isomorphic to a Cayley graph, which implies the connected components are cosets of the subcode generated by low-weight codewords. This transforms the existence problem into a subcode generation problem. Second, a classical result of Simonis shows any linear code can be transformed into one with the same parameters whose basis consists entirely of minimum-weight codewords. We develop a converse construction: under certain conditions on the weight distribution, a linear code can be transformed into a new code with the same parameters but fewer independent minimum-weight codewords, thereby producing codes suitable for use as strict function-correcting codes. As a source of codes satisfying these conditions, we introduce chain codes, an infinite family of linear codes generated by their minimum-weight codewords. Third, we present an independent construction of strict function-correcting codes from narrow-sense BCH codes with designed distance three, by proving the minimum-weight codewords of such codes are contained in a proper subcode.