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

Modern Technologies in Science and Education (MTSE)

COMPARISON OF THE CURVES OF THE DEPENDENCE OF THE PROBABILITY OF BIT ERROR ON THE SIGNAL-TO-NOISE RATIO OF HAMMING CODES AND REED-MULLER CODES BASED ON THEM

A.A. Zakharkin, Aleksei Ovinnikov

Published Jun 15, 2025• 0 citations
Publisher

Abstract

The paper presents a comparison of the noise immunity curves of a number of Hemming codes and extended Hemming codes, which are Reed-Muller codes. A brief description of the latest codes is provided, as well as conclusions on the work.
DOI
10.21667/978-5-7722-0425-2-23-26

Related papers

Efficiently decoding Reed-Muller codes from random errors

Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk

Reed-Muller codes encode an m-variate polynomial of degree r by evaluating it on all points in {0,1}m. We denote this code by RM(m,r). The minimal distance of RM(m,r) is 2m−r and so it cannot correct more than half that number of errors in the worst case. For random errors one may hope for a better result.

ACM Symposium on Theory of Computing (STOC)•Jun 10, 2016•7 citations

Reed-Muller Codes for Random Erasures and Errors

Emmanuel A. Abbe, Amir Shpilka, Avi Wigderson

This paper studies the parameters for which binary Reed-Muller (RM) codes can be decoded successfully on the BEC and BSC, and in particular when can they achieve capacity for these two classical channels. Necessarily, the paper also studies properties of evaluations of multi-variate GF(2) polynomials on random sets of inputs. For erasures, we prove that RM codes achieve capacity both for very high rate and very low rate regimes. For errors, we prove that RM codes achieve capacity for very low rate regimes, and for very high rates, we show that they can uniquely decode at about square root of the number of errors at capacity.

ACM Symposium on Theory of Computing (STOC)•Jun 3, 2015•18 citations

Decoding of Reed-Muller codes with polylogarithmic complexity

Ilya I. Dumer

Code transmission is considered over a binary symmetric (BS) channel whose bit error probability is arbitrarily close to 1/2. New recursive decoding algorithms are designed for Reed-Muller (RM) codes of growing length 2m and fixed order r. The algorithms retrieve all information with a vanishing error probability and polylogarithmic complexity of order mr+1.

•Jan 5, 2004•2 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

Kodning och avkodning av Reed-Muller koder

Meyer, Linda

In this thesis some families of linear error correcting codes are presented. The reader will find a general description of binary codes and more specific details about linear codes such as Hamming, repetition codes, Reed-Muller codes, etc. To fully immerse ourselves in the methods of coding and decoding, we will introduce examples in order to contribute to the understanding of the theories. In these times of much communication through computer technology, our daily lives involve a substantial amount of data transmission. It is essential that these data are transmitted without errors through the communication channels. Therefore, the scientific field of error-correcting codes holds a significant importance in many aspects of todays society. The main goal of this thesis is to study linear block codes which belong to the class of binary codes. In this case we will attribute a more prominent role to first order Reed-Muller codes.

•Jan 1, 2021•0 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
This paper studies the parameters for which binary Reed-Muller (RM) codes can be decoded successfully on the BEC and BSC, and in particular when can they achieve capacity for these two classical channels. Necessarily, the paper also studies properties of evaluations of multi-variate GF(2) polynomials on random sets of inputs. For erasures, we prove that RM codes achieve capacity both for very high rate and very low rate regimes. For errors, we prove that RM codes achieve capacity for very low rate regimes, and for very high rates, we show that they can uniquely decode at about square root of the number of errors at capacity.
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.
In this thesis some families of linear error correcting codes are presented. The reader will find a general description of binary codes and more specific details about linear codes such as Hamming, repetition codes, Reed-Muller codes, etc. To fully immerse ourselves in the methods of coding and decoding, we will introduce examples in order to contribute to the understanding of the theories. In these times of much communication through computer technology, our daily lives involve a substantial amount of data transmission. It is essential that these data are transmitted without errors through the communication channels. Therefore, the scientific field of error-correcting codes holds a significant importance in many aspects of todays society. The main goal of this thesis is to study linear block codes which belong to the class of binary codes. In this case we will attribute a more prominent role to first order Reed-Muller codes.