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.
Some properties of unitary Cayley graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.