Back to search

Clemson University

DECODING OF MULTIPOINT ALGEBRAIC GEOMETRY CODES VIA LISTS

Abstract

dc:description.abstract

Algebraic geometry codes have been studied greatly since their introduction by Goppa . Early study had focused on algebraic geometry codes CL(D;G) where G was taken to be a multiple of a single point. However, it has been shown that if we allow G to be supported by more points, then the associated code may have better parameters. We call such a code a multipoint code and if G is supported by m points, then we call it an m-point code. In this dissertation, we wish to develop a decoding algorithm for multipoint codes. We show how we can embed a multipoint algebraic geometry code into a one-point supercode so that we can perform list decoding in the supercode. From the output list, we determine which of the elements is a codeword in the multipoint code. In this way we have unique decoding up to the minimum distance for multipoint algebraic geometry codes, provided the parameters of the list decoding algorithm are set appropriately.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy (PhD)
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Mathematical Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Drake, Nathan
Contributors dc:contributor
  • Matthews, Gretchen
  • Calkin , Neil
  • Gao , Shuhong
  • Xue , Hui

Subjects

dc:subject × 4

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_dissertations/491

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Drake, Nathan. DECODING OF MULTIPOINT ALGEBRAIC GEOMETRY CODES VIA LISTS. Dissertation thesis, https://open.clemson.edu/all_dissertations/491