4 problems

Let $t\geq 1$ and $q\geq 2t(t+1)+1$. For a function $f$, consider the encoding … where $p\in[2t:\lfloor q/2\rfloor]$. The code is required to function-correct for the Lee weight fu…

Function-correcting codes (FCCs) are codes that enable recovery of a prescribed function of the message in the presence of errors. Let the redundancy of an FCC be the difference be…

Let function-correcting codes be considered over finite fields, and let the bound on their optimal redundancy be the upper bound established in the preceding work. Ly–Soljanin's co…

Finite-field upper-bound conjecture. For all $q<k+2t$,