Derives a Plotkin-like bound for irregular Lee-distance codes and explicit optimal FCLCs for Lee weight, modular sum, and related functions.
On the redundancy of function-correcting codes over finite fields,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2years
2025 2verdicts
UNVERDICTED 2representative citing papers
Develops a general framework and explicit constructions for function-correcting codes with data protection, including bounds and results for linear codes and specific functions.
citing papers explorer
-
Plotkin-like Bound and Explicit Function-Correcting Code Constructions for Lee Metric Channels
Derives a Plotkin-like bound for irregular Lee-distance codes and explicit optimal FCLCs for Lee weight, modular sum, and related functions.
-
Function-Correcting Codes With Data Protection
Develops a general framework and explicit constructions for function-correcting codes with data protection, including bounds and results for linear codes and specific functions.