A recursive mask construction yields at most 2^s m^{s-1} patterns that are RM(s-1,m) codewords, forming a nonlinear subcode of RM(r,m) for joint stuck-at and random error correction with encoder-only defect side information.
Title resolution pending
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
-
Reed-Muller Codes for Joint Random and Stuck-At Error Correction
A recursive mask construction yields at most 2^s m^{s-1} patterns that are RM(s-1,m) codewords, forming a nonlinear subcode of RM(r,m) for joint stuck-at and random error correction with encoder-only defect side information.