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.
Non-existence of some function-correcting codes with data protection
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2years
2026 2representative citing papers
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
-
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.