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

arXiv:quant-ph/9608026 · IEEE Transactions on Information Theory

Quantum Reed-Muller codes

Andrew M. Steane

Published Jul 1, 1999• 175 citations
arXivHTMLPDF

Abstract

A set of quantum error-correcting codes based on classical Reed-Muller codes is described. The codes have parameters [[n,k,d]]=[[2/sup r/,s/sup r/-C(r,t)-2/spl Sigma//sub i=0//sup t-1/C(r,i),2/sup t/+2/sup t-1/]].
DOI
10.1109/18.771249

Related papers

量子 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 Reed-Muller Codes

Zhang, Lin, Ian Fuss

This paper presents a set of quantum Reed-Muller codes which are typically 100 times more effective than existing quantum Reed-Muller codes.

arXiv:quant-ph/9703045•Mar 24, 1997•10 citations

Error-correction capability of Reed-Muller codes

Stéphanie Dib, François Rodier

We present an asymptotic limit between correctable and uncorrectable errors on the Reed-Muller codes of any order and give its value. This limit is theoretical and does not depend on any decoding algorithm.

arXiv:1411.3545•Contemporary mathematics - American Mathematical Society•Jan 1, 2017•0 citations

Simple MAP decoding of first order Reed-Muller and Hamming codes

Alexei Ashikhmin, Simon N. Litsyn

We present new MAP decoding algorithms for first order Reed-Muller and Hamming codes. The proposed algorithms have complexities proportional to n/spl times/log/sub 2/(n), where n is the code length.

IEEE Information Theory Workshop (ITW)•Mar 2, 2004•6 citations

Quantum Cyclic and Constacyclic Codes

L. Xiaoyan

Based on classical quaternary constacyclic linear codes, we construct a set of quantum codes with parameters [[(4/sup m/ -1)/3, (4/sup m/ -1)/3 -2(3l + b)m, 4l + b + 2]] where m/spl ges/4, 1/spl les/b/spl les/3, and 12l + 3b < 2 /spl times/ 4/sup /spl lfloor/(m+2)/3/spl rfloor//-1, which are better than the codes in Bierbrauer and Edel (2000).

IEEE Transactions on Information Theory•Mar 1, 2004•43 citations

Nonbinary quantum Reed-Muller codes

Pradeep Kiran Sarvepalli, Andreas Klappenecker

We construct nonbinary quantum codes from classical generalized Reed-Muller codes and derive the conditions under which these quantum codes can be punctured. We provide a partial answer to a question raised by Grassl, Beth and Rotteler on the existence of q-ary quantum MDS codes of length n with q les n les q2- 1

arXiv:quant-ph/0502001•IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2005•56 citations
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.