The Covering Radius of the Reed--Muller Code RM(2,7) is 40

09/13/2018
by   Qichun Wang, et al.
0

It was proved by J. Schatz that the covering radius of the second order Reed--Muller code RM(2, 6) is 18 (IEEE Trans Inf Theory 27: 529--530, 1985). However, the covering radius of RM(2,7) has been an open problem for many years. In this paper, we prove that the covering radius of RM(2,7) is 40, which is the same as the covering radius of RM(2,7) in RM(3,7). As a corollary, we also find new upper bounds for RM(2,n), n=8,9,10.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/09/2021

The covering radius of permutation designs

A notion of t-designs in the symmetric group on n letters was introduced...
research
06/25/2021

The Covering Radius of the Reed-Muller Code RM(m-4,m) in RM(m-3,m)

We present methods for computing the distance from a Boolean polynomial ...
research
06/29/2022

Saturating systems and the rank covering radius

We introduce the concept of a rank saturating system and outline its cor...
research
01/10/2013

A remark on covering

We discuss construction of coverings of the unit ball of a finite dimens...
research
02/05/2023

Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems

We introduce a novel framework for implementing error-correction in cons...
research
02/24/2022

An Algorithm for Computing the Covering Radius of a Linear Code Based on Vilenkin-Chrestenson Transform

We present a generalization of Walsh-Hadamard transform that is suitable...
research
10/02/2022

The Second-Order Football-Pool Problem and the Optimal Rate of Generalized-Covering Codes

The goal of the classic football-pool problem is to determine how many l...

Please sign up or login with your details

Forgot password? Click here to reset