Macaulay2 » Documentation
Packages » CodingTheory » EvaluationCode » evaluationCode » reedMullerCode
next | previous | forward | backward | up | index | toc

# reedMullerCode -- constructs the Reed-Muller code

- Usage:
    `reedMullerCode(q,m,d)`
- Inputs:
  - q, an integer,
  - m, an integer,
  - d, an integer,
- Outputs:
  - an instance of the type EvaluationCode,

## Description

Given the integers q, m and d, returns the Reed-Muller code obtained when polynomials in m variables of total degree at most d are evaluated on the points of GF(q)$^\mathtt{m}$.

    i1 : C=reedMullerCode(2,3,4);

    i2 : C.Sets;

    i3 : C.VanishingIdeal;

    o3 : Ideal of GF 2[t ..t ]
                        0   2

    i4 : C.PolynomialSet;

    i5 : C.LinearCode;

    i6 : length C.LinearCode

    o6 = 8

## Ways to use reedMullerCode:

- `reedMullerCode(ZZ,ZZ,ZZ)`

## For the programmer

The object reedMullerCode is a method function.

The source of this document is in /build/macaulay2-88fgJW/macaulay2-1.25.11+ds/M2/Macaulay2/packages/CodingTheory.m2:4858:0.