A Tutorial on AG Code Construction from a Gröbner Basis Perspective

DOI10.1007/978-3-540-93806-4_6zbMath1179.14026OpenAlexW5304206MaRDI QIDQ3652813

Douglas A. Leonard

Publication date: 16 December 2009

Published in: Gröbner Bases, Coding, and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-93806-4_6

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications to coding theory and cryptography of arithmetic geometry (14G50) Combinatorial codes (94B25)

Related Items (1)

A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound

This page was built for publication: A Tutorial on AG Code Construction from a Gröbner Basis Perspective