Presents a concatenated Reed-Solomon–Hadamard code VSA whose recovery reduces to an optimal histogram recovery problem solved via list-decoding, delivering improved noise tolerance over prior Hadamard or random-linear constructions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Efficient Vector Symbolic Architectures from Histogram Recovery
Presents a concatenated Reed-Solomon–Hadamard code VSA whose recovery reduces to an optimal histogram recovery problem solved via list-decoding, delivering improved noise tolerance over prior Hadamard or random-linear constructions.