Back to search

Clemson University

Applications of Algebraic Geometric Codes to Polar Coding

Abstract

dc:description.abstract

In recent groundbreaking work, Arikan developed polar codes as an explicit construction of symmetric capacity achieving codes for binary discrete memoryless channels with low encoding and decoding complexities. In this construction, a specific kernel matrix G is considered and is used to encode a block of channels. As the number of channels grows, each channel becomes either a noiseless channel or a pure-noise channel, and the rate of this polarization is related to the kernel matrix used. Since Arikan's original construction, polar codes have been generalized to q-ary discrete memoryless channels, where q is a power of a prime, and other matrices have been considered as kernels. In our work, we expand on the ideas of Mori and Tanaka and Korada, Sasoglu, and Urbanke by employing algebraic geometric codes to produce kernels of polar codes, specifically codes from maximal and optimal function fields.

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
  • Anderson, Sarah E
Contributors dc:contributor
  • Dr. Gretchen L. Matthews
  • Dr. Jim Brown
  • Dr. Shuhong Gao
  • Dr. Felice Manganiello

Identifiers

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

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
related terms
citation

Anderson, Sarah E. Applications of Algebraic Geometric Codes to Polar Coding. Dissertation thesis, https://open.clemson.edu/all_dissertations/1471