Algebraic and analytic techniques in coding theory
| dc.contributor.advisor | Zuckerman, David I. | en |
| dc.contributor.committeeMember | Bajaj, Chandrajit | en |
| dc.contributor.committeeMember | Gal, Anna | en |
| dc.contributor.committeeMember | Lovett, Shachar | en |
| dc.contributor.committeeMember | Price, Eric | en |
| dc.creator | Bhowmick, Abhishek | en |
| dc.date.accessioned | 2016-02-16T19:09:52Z | en |
| dc.date.available | 2016-02-16T19:09:52Z | en |
| dc.date.issued | 2015-12 | en |
| dc.date.submitted | December 2015 | en |
| dc.date.updated | 2016-02-16T19:09:53Z | en |
| dc.description.abstract | Error correcting codes are designed to tackle the problem of reliable trans- mission of data through noisy channels. A major challenge in coding theory is to efficiently recover the original message even when many symbols of the received data have been corrupted. This is called the unique decoding problem of error correcting codes. More precisely, if the user wants to send K bits, the code stretches K bits to N bits to tolerate errors in the N bits. Then the goal is to recover the original K bits of the message. Often, the receiver requires only a certain part of the message. In such cases, analyzing the entire received data (word) becomes prohibitive. The challenge is to design a local decoder which queries only few locations of the received word and outputs the part of the message required. This is known as local decoding of an error correcting code. The unique decoding problem faces a certain combinatorial barrier. That is, there is a limit to the number of errors it can tolerate in order to uniquely identify the correct message. This is called the unique decoding radius. A major open problem is to understand what happens if one allows for errors beyond this threshold. The goal is to design an algorithm that can recover the right message, or possibly a list of messages (preferably a small number). This is referred to as list decoding of an error correcting code. At the core of many such codes lies polynomials. Polynomials play a fundamental role in computer science with important applications in algorithm design, complexity theory, pseudo-randomness and machine learning. In this dissertation, we improve our understanding of well known classes of codes and discover various properties of polynomials. As an additional consequence, we obtain results in a suite of problems in effective algebraic geometry, including Hilbert’s nullstellensatz, ideal membership problem and counting rational points in a variety. | en |
| dc.description.department | Computer Science | |
| dc.format.mimetype | application/pdf | en |
| dc.identifier | doi:10.15781/T2T10V | en |
| dc.identifier.uri | http://hdl.handle.net/2152/33308 | en |
| dc.language.iso | en | en |
| dc.subject | Polynomials | en |
| dc.subject | Coding theory | en |
| dc.title | Algebraic and analytic techniques in coding theory | en |
| dc.type | Thesis | en |
| thesis.degree.department | Computer Sciences | en |
| thesis.degree.discipline | Computer science | en |
| thesis.degree.grantor | The University of Texas at Austin | en |
| thesis.degree.level | Doctoral | en |
| thesis.degree.name | Doctor of Philosophy | en |