Year: 2025
Type: article
Abstract: When communicating over a noisy channel, the probability of message interference sets a maximum possible transmission rate known as the channel capacity. Any family of codes which have rates converging to the channel capacity and arbitrarily low probability of decoding failure is called capacity achieving. Such codes have been known to exist since the birth of information theory but are difficult to find explicitly. It has recently been shown that the permutation groups of a family of codes can be used to show that the family is capacity achieving on the q-ary erasure channel.This this thesis seeks to apply the permutation results to specific families of codes to find and classify new families of capacity achieving codes. In particular, we focus on methods of combining existing component codes to obtain new capacity achieving codes. Chapters 1 and 2 deal with the necessary background information for the research. Chapters 3 and 4 deal with product codes and half-product codes, first in two dimensions and then in higher dimensions. Chapter 5 focuses on an attempt to re-purpose the original low density parity code construction to be a deterministic capacity achieving family. Chapter 6 deals with cyclic codes and develops a simplified method of obtaining capacity achieving codes in the cyclic case.Advisor: Christine Kelley
Source: Lincoln (University of Nebraska)
Author: Welchons, Daniel Joseph
Institution: University of Nebraska–Lincoln
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W6987911371
FWCI:
Cites:
Cited by:
Related to: