Channel coding is the branch of Information Theory which studies the noise that can occur in data transmitted through a channel. Algebraic Coding Theory is the part of Channel Coding which studies the possibility to detect and correct errors using algebraic and geometric techniques. Nowadays, the best performing linear codes are known to be mostly algebraic geometry codes, also named Goppa codes, which arise from an algebraic curve over a finite field, by the pioneering construction due to V. D. Goppa. The best choices for curves on which Goppa's construction and its variants may provide codes with good parameters are those with many rational points, especially maximal curves attaining the Hasse-Weil upper bound for the number of rational points compared with the genus of the curve. Unfortunately, maximal curves are difficult to find. The best known examples of maximal curves are the Hermitian curve, the Ree curve, the Suzuki curve, the GK curve and the GGS curve.
In the present thesis, we construct and investigate algebraic geometry codes (shortly AG codes), their parameters and automorphism groups.
| Identifer | oai:union.ndltd.org:unitn.it/oai:iris.unitn.it:11572/368573 |
| Date | January 2019 |
| Creators | Bonini, Matteo |
| Contributors | Bonini, Matteo, Sala, Massimiliano, Rinaldo, Giancarlo |
| Publisher | Università degli studi di Trento, place:TRENTO |
| Source Sets | Università di Trento |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/doctoralThesis |
| Rights | info:eu-repo/semantics/closedAccess |
| Relation | firstpage:1, lastpage:110, numberofpages:110 |
Page generated in 0.003 seconds