← All problems

Beelen–Datta–Ghorpade conjecture on projective Reed–Muller codes

This entry tracks Beelen–Datta–Ghorpade conjecture on projective Reed–Muller codes.

It resolves the central parameter range while extending bounds more broadly.

Latest development

Generalized Hamming weights are determined in the low-degree range, with further bounds in every degree and a complete projective-plane result.

Editorial caveat

The all-degree sharpness conjecture remains open.

References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.