WebThis leads to a O(d4 d)-query test for degree d Reed-Muller codes. We give an asymptotically optimal analysis of T 0, showing that it rejects functions that are ω(1)-far with ω(1) … WebThis section introduces the main concepts of classical codes and quantum reading needed for this paper. We begin with a brief overview of cyclic codes and then specialize in Reed–Solomon and BCH codes. Subsequently, we show a construction method for Reed–Muller codes that is similar to Reed–Solomon codes.
Optimal Testing of Reed-Muller Codes SpringerLink
WebApr 12, 2024 · By optimal soundness, we mean that if the tester accepts with probability at least (where is small), then it must be the case that is -close to some codeword in Hamming distance. We show that Generalized Reed-Muller codes admit optimal testers with queries. Here, for a prime power , the Generalized Reed-Muller code, RM [n,q,d], consists of the ... WebThe following are used throughout the paper: • For nonnegative integers r m, RM(m,r) denotes the Reed-Muller code whose codewords are the evaluation vectors of all multivariate polynomials of degree at most r on m Boolean variables. The maximal degree r is sometimes called the order of the code. greenback trout colorado
Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries
WebThis leads to a O(d 4 d)-query test for degree d Reed-Muller codes. We give an asymptotically optimal analysis of T 0, showing that it rejects functions that are Ω(1)-far … WebWe consider the problem of testing if a given function $f : \\F_2^n \\right arrow \\F_2$ is close to any degree $d$ polynomial in $n$ variables, also known as the ... WebOur methods are more general and also allow us to prove that a wide class of testers, which follow the form of the Ron-Zewi and Sudan tester, are optimal. This result applies to testers for all affine-invariant codes (which are not necessarily generalized Reed-Muller codes). flowers for algernon short story theme