Reed-Muller codes achieve the full achievable rate region on two-user additive-noise channels, and the resulting quantum CSS codes meet the hashing bound across a continuous range of Pauli noise parameters.
Quantum Reed-Muller Codes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
This paper presents a set of quantum Reed-Muller codes which are typically 100 times more effective than existing quantum Reed-Muller codes.
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Reed-Muller Codes for Quantum Pauli and Multiple Access Channels
Reed-Muller codes achieve the full achievable rate region on two-user additive-noise channels, and the resulting quantum CSS codes meet the hashing bound across a continuous range of Pauli noise parameters.