Derives a Plotkin-like bound for irregular Lee-distance codes and explicit optimal FCLCs for Lee weight, modular sum, and related functions.
Interleaving schemes for multidi- mensional cluster errors,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
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.