Derives a Plotkin-like bound for irregular Lee-distance codes and explicit optimal FCLCs for Lee weight, modular sum, and related functions.
On Function-Correcting Codes in the Lee Metric
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.IT 3representative citing papers
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.
Linear codes qualify as strict function-correcting codes with data protection precisely when the subcode generated by their minimum-weight codewords is proper, with chain codes and narrow-sense BCH codes of designed distance three serving as infinite families that satisfy the condition.
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.
-
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.
-
Existence and Constructions of Strict Function-Correcting Codes with Data Protection
Linear codes qualify as strict function-correcting codes with data protection precisely when the subcode generated by their minimum-weight codewords is proper, with chain codes and narrow-sense BCH codes of designed distance three serving as infinite families that satisfy the condition.