Derives a Plotkin-like bound for irregular Lee-distance codes and explicit optimal FCLCs for Lee weight, modular sum, and related functions.
Optimal redundancy of function-correcting codes
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
fields
cs.IT 4representative citing papers
A construction for optimal SEFCCs on the Hamming code membership function is given by reducing distance-2 pair minimization to a max-cut problem solved via eigenvectors of distance-4 graphs, with optimality for even n attained by bent functions.
Generalized function-correcting partition codes unify protection for multiple message partitions with varying distance requirements and can achieve strictly lower redundancy than summing individual protections or using the strongest single code.
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-Correction with Optimal Data Protection for the General Hamming Code Membership
A construction for optimal SEFCCs on the Hamming code membership function is given by reducing distance-2 pair minimization to a max-cut problem solved via eigenvectors of distance-4 graphs, with optimality for even n attained by bent functions.
-
Generalized Function-Correcting Partition Codes
Generalized function-correcting partition codes unify protection for multiple message partitions with varying distance requirements and can achieve strictly lower redundancy than summing individual protections or using the strongest single code.
-
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.