Math 2.0

Areas Coding theory Topic

Algebraic geometry codes

Summary

This topic is a part of coding theory. It covers Goppa's codes from curves over finite fields, their parameters from the Riemann-Roch theorem, the codes that are better than the Gilbert-Varshamov bound, and their decoding.

About this page
TagGRCDH560QZ
URIm2://GRCDH560QZ
Kindtopic
WritingW0 stub
MSC94B27, 14G50, 11G20
Part ofCoding theory
Changed17 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a same_as or a source (0 of 1)
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

No page links to this page yet.