Polynomial Codewords on a 2D Grid

Build a small polynomial evaluation code over Fq × Fq. Each coefficient vector defines a polynomial, and each polynomial becomes a tiny finite-field image.

f(x,y)=Σ aijxiyj mod q, evaluated at every (x,y) ∈ Fq2.

1. Choose the polynomial space

2. Monomial region

The exponent grid shows monomials x^i y^j. Blue cells are included in the code’s generator basis. In custom mode, click cells to include or remove them.

3. Browse codewords

Index 0 of 0 Code size: 1
coefficients = []

4. Codeword as pixels

Hamming weight0
Total brightness0
Average value0
Parametersn=25, k=0

5. Exact evaluation grid

Rows are x-values. Columns are y-values.

6. Hamming weight distribution

Red marker = current codeword. Computed exhaustively when feasible.

7. Brightness distribution

Brightness is the sum of field values across the grid. It is a visual statistic, not a standard code invariant.

8. Generator grids

Each selected monomial evaluates to one generator codeword. Linear combinations of these generator grids form the code.

Ready. Start with the F5 hyperbolic preset, or change q and the monomial rule.