Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Soviet physics. Doklady

On the Number of Errors Which Can Be Corrected by the Reed-Muller Code

R.E. Krichevskii

Published Sep 1, 1970• 3 citations
OpenAlex

Related papers

Recursive error correction for general Reed–Muller codes

Ilya I. Dumer, Kirill Shabunov

Discrete Applied Mathematics•Sep 20, 2005•17 citations

Correctable Errors of Weight Half the Minimum Distance for the First-Order Reed-Muller Codes

Kenji Yasunaga, Toru Fujiwara

IEEE International Symposium on Information Theory (ISIT)•Nov 28, 2006•1 citation

Hulls of Projective Reed–Muller Codes over the Projective Plane

Diego Ruano, Rodrigo San–José

Abstract. By solving a problem regarding polynomials in a quotient ring, we obtain the relative hull and the Hermitian hull of projective Reed–Muller codes over the projective plane. The dimension of the hull determines the minimum number of maximally entangled pairs required for the corresponding entanglement-assisted quantum error-correcting code. Hence, by computing the dimension of the hull we now have all the parameters of the symmetric and asymmetric entanglement-assisted quantum error-correcting codes constructed with projective Reed–Muller codes over the projective plane. As a byproduct, we also compute the dimension of the Hermitian hull for affine Reed–Muller codes in two variables.

arXiv:2312.13921•SIAM Journal on Applied Algebra and Geometry•Nov 18, 2024•8 citations

量子 Reed-Müller 碼

鄭閔鴻

In this thesis, we start from the theory of classical error-correcting codes. We also introduce classical Reed-Muller codes along with its properties. We discuss the encoding and decoding methods for classical Reed-Muller codes using the majority rule. Then we turn to the topic of quantum error-correcting codes.We talk about stabilizer codes and discuss how classical Reed-Muller codes can be transformed into quantum Reed-Muller codes using Steane's method. Finally, we give a construction of a quantum code with parameter [[8,3,3]], and discuss its encoding and decoding process.

•Jan 1, 2011•0 citations

Quantum error-correcting codes from projective Reed–Muller codes and their hull variation problem

Diego Ruano, Rodrigo San–José

Long quantum codes using projective Reed–Muller codes are constructed. Projective Reed–Muller codes are evaluation codes obtained by evaluating homogeneous polynomials at the projective space. We obtain asymmetric and symmetric quantum codes by using the CSS construction and the Hermitian construction, respectively. We provide entanglement-assisted quantum error-correcting codes from projective Reed–Muller codes with flexible amounts of entanglement by considering equivalent codes. Moreover, we also construct quantum codes from subfield subcodes of projective Reed–Muller codes.

arXiv:2312.15308•Journal of Algebra and Its Applications•Feb 13, 2025•7 citations

Introduction to the theory of error-correcting codes

Ian F. Blake

Proceedings of the IEEE•Jul 1, 1984•30 citations
Abstract. By solving a problem regarding polynomials in a quotient ring, we obtain the relative hull and the Hermitian hull of projective Reed–Muller codes over the projective plane. The dimension of the hull determines the minimum number of maximally entangled pairs required for the corresponding entanglement-assisted quantum error-correcting code. Hence, by computing the dimension of the hull we now have all the parameters of the symmetric and asymmetric entanglement-assisted quantum error-correcting codes constructed with projective Reed–Muller codes over the projective plane. As a byproduct, we also compute the dimension of the Hermitian hull for affine Reed–Muller codes in two variables.
In this thesis, we start from the theory of classical error-correcting codes. We also introduce classical Reed-Muller codes along with its properties. We discuss the encoding and decoding methods for classical Reed-Muller codes using the majority rule. Then we turn to the topic of quantum error-correcting codes.We talk about stabilizer codes and discuss how classical Reed-Muller codes can be transformed into quantum Reed-Muller codes using Steane's method. Finally, we give a construction of a quantum code with parameter [[8,3,3]], and discuss its encoding and decoding process.
Long quantum codes using projective Reed–Muller codes are constructed. Projective Reed–Muller codes are evaluation codes obtained by evaluating homogeneous polynomials at the projective space. We obtain asymmetric and symmetric quantum codes by using the CSS construction and the Hermitian construction, respectively. We provide entanglement-assisted quantum error-correcting codes from projective Reed–Muller codes with flexible amounts of entanglement by considering equivalent codes. Moreover, we also construct quantum codes from subfield subcodes of projective Reed–Muller codes.