On the Redundancy of Function-Correcting Codes over Finite Fields

Function-correcting codes (FCC) protect specific function evaluations of a message against errors. This condition imposes a less stringent distance requirement than classical error-correcting codes (ECC), allowing for reduced redundancy. FCC were introduced by Lenz et al. (2021), who also established a lower bound on the optimal redundancy for FCC over the binary field. Here, we derive an upper bound within a logarithmic factor of this lower bound. We show that the same lower bound holds for any finite field. Moreover, we show that this bound is matched for sufficiently large fields by demonstrating that it also serves as an upper bound. Furthermore, we construct an encoding scheme that achieves this optimal redundancy. Finally, motivated by these two extreme regimes, we conjecture that our bound serves as a valid upper bound across all finite fields.