Reed-Muller codes achieve vanishing bit-error probability below Holevo capacity on binary-input symmetric classical-quantum channels.
A class of multiple-error-correcting codes and the decoding scheme,
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
-
Reed-Muller Codes on CQ Channels via a New Correlation Bound for Quantum Observables
Reed-Muller codes achieve vanishing bit-error probability below Holevo capacity on binary-input symmetric classical-quantum channels.