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

IEEE Transactions on Information Theory

Higher Grassmann Codes III: Quantum Variants

Mahir Bilen Can, Roy Joshua⋆

Published Aug 6, 2025• 0 citations
Publisher

Abstract

We show that it is possible to break up Higher Grassmann codes we constructed in earlier work to a sequence of affine Reed-Muller codes so that various operations such as decoding can be reduced to performing these operations for the component affine Reed-Muller codes. Then we consider quantum codes produced from a pair of Higher Grassmann codes and discuss also their encoding and decoding aspects in some detail.

DOI
10.1109/tit.2025.3596479

Related papers

Interpolation of Quantum Polar Codes and Quantum Reed-Muller Codes

Keita Hidaka, Dina Abdelhadi, Rudiger L. Urbanke

Good quantum error-correcting codes that fulfill practical considerations, such as simple encoding circuits and efficient decoders, are essential for functional quantum information processing systems. Quantum polar codes satisfy some of these requirements but lack certain critical features, thereby hindering their widespread use. Existing constructions either require entanglement assistance to produce valid quantum codes, suffer from poor finite-size performance, or fail to tailor polar codes to the underlying channel properties. Meanwhile, quantum Reed-Muller (RM) codes demonstrate strong performance, though no known efficient decoding algorithm exists for them. In this work, we propose strategies to interpolate between quantum polar codes and quantum RM codes, thus addressing the challenges of designing valid quantum polar codes without entanglement assistance and improving finite-size code performance.

arXiv:2505.22142•IEEE Information Theory Workshop (ITW)•Sep 29, 2025•0 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

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•53 citations

Interpreting KO Codes

R. Shekhar, Natasha Devroye, Gy. Turán +1 more

The KO (Kronecker Operation) code is a recent deep-learned error-correcting code using a neural network architecture to generalize a Reed-Muller code with Dumer decoding. Analyzing the encoder modules and using ablation techniques, we give interpretations of the KO encoder which significantly reduce the number of parameters. We also discuss interpretability aspects of the KO decoder. The interpretation opens up possibilities to give an explicit representation of KO codes, which could be useful for more efficient learning of KO codes and explaining the learning mechanism underlying the empirical observations made about its performance in previous work.

IEEE International Symposium on Information Theory (ISIT)•Jun 22, 2025•0 citations

Quantum codes from two-point Hermitian codes

Justine C. Hyde-Volpe

We explore the background on error-correcting codes, including linear codes and quantum codes from curves. Then we consider the parameters of quantum codes constructed from two-point Hermitian codes.

•Jan 1, 2010•0 citations

New decoding algorithm for a class of simple iterated codes–its application to decoding algorithm for reed‐muller codes

Kin‐ichiroh Tokiwa, Nasao Kasahara, Toshihiko Namekawa

Abstract Recently, for the improvement of reliability of digital communication systems, various kinds of error‐correcting codes are being used. to improve system reliability through the use of more capable error‐correcting codes it is extremely important to simplify the decoder construction and to reduce the decoding delay. This paper studies a decoding algorithm for a class of simple iterated codes (SI codes) constructed by simply repeating I times a codeword (called block) in a given code (called subcode). Moreover, this paper discusses the decoding delay when this decoding algorithm is applied to decoding the Reed‐Muller codes constructed by the superimposing method.

Electronics and Communications in Japan (Part I Communications)•Jan 1, 1984•0 citations
We show that it is possible to break up Higher Grassmann codes we constructed in earlier work to a sequence of affine Reed-Muller codes so that various operations such as decoding can be reduced to performing these operations for the component affine Reed-Muller codes. Then we consider quantum codes produced from a pair of Higher Grassmann codes and discuss also their encoding and decoding aspects in some detail.
Good quantum error-correcting codes that fulfill practical considerations, such as simple encoding circuits and efficient decoders, are essential for functional quantum information processing systems. Quantum polar codes satisfy some of these requirements but lack certain critical features, thereby hindering their widespread use. Existing constructions either require entanglement assistance to produce valid quantum codes, suffer from poor finite-size performance, or fail to tailor polar codes to the underlying channel properties. Meanwhile, quantum Reed-Muller (RM) codes demonstrate strong performance, though no known efficient decoding algorithm exists for them. In this work, we propose strategies to interpolate between quantum polar codes and quantum RM codes, thus addressing the challenges of designing valid quantum polar codes without entanglement assistance and improving finite-size code performance.
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.
The KO (Kronecker Operation) code is a recent deep-learned error-correcting code using a neural network architecture to generalize a Reed-Muller code with Dumer decoding. Analyzing the encoder modules and using ablation techniques, we give interpretations of the KO encoder which significantly reduce the number of parameters. We also discuss interpretability aspects of the KO decoder. The interpretation opens up possibilities to give an explicit representation of KO codes, which could be useful for more efficient learning of KO codes and explaining the learning mechanism underlying the empirical observations made about its performance in previous work.
Abstract Recently, for the improvement of reliability of digital communication systems, various kinds of error‐correcting codes are being used. to improve system reliability through the use of more capable error‐correcting codes it is extremely important to simplify the decoder construction and to reduce the decoding delay. This paper studies a decoding algorithm for a class of simple iterated codes (SI codes) constructed by simply repeating I times a codeword (called block) in a given code (called subcode). Moreover, this paper discusses the decoding delay when this decoding algorithm is applied to decoding the Reed‐Muller codes constructed by the superimposing method.