Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > REED-MULLER:
Reports tagged with Reed-Muller:
TR08-111 | 14th November 2008
Shachar Lovett, Tali Kaufman

#### The List-Decoding Size of Reed-Muller Codes

Revisions: 2

In this work we study the list-decoding size of Reed-Muller codes. Given a received word and a distance parameter, we are interested in bounding the size of the list of Reed-Muller codewords that are within that distance from the received word. Previous bounds of Gopalan, Klivans and Zuckerman~\cite{GKZ08} on the ... more >>>

TR09-030 | 5th April 2009
Shachar Lovett

#### The density of weights of Generalized Reed-Muller codes

We study the density of the weights of Generalized Reed--Muller codes. Let \$RM_p(r,m)\$ denote the code of multivariate polynomials over \$\F_p\$ in \$m\$ variables of total degree at most \$r\$. We consider the case of fixed degree \$r\$, when we let the number of variables \$m\$ tend to infinity. We ... more >>>

ISSN 1433-8092 | Imprint