Codes and Curves

When information is transmitted, errors are likely to occur. Coding theory examines effi cient ways of packaging data so that these errors can be detected, or even corrected. The traditional tools of coding theory have come from combinatorics and group theory. Lately, however, coding theorists have added techniques from algebraic geometry to their toolboxes. In particular, by re-interpreting the Reed- Solomon codes, one can see how to defi ne new codes based on divisors on algebraic curves. For instance, using modular curves over fi nite fi elds, Tsfasman, Vladut, and Zink showed that one can defi ne a sequence of codes with asymptotically better parameters than any previously known codes. This monograph is based on a series of lectures the author gave as part of the IAS/PCMI program on arithmetic algebraic geometry. Here, the reader is introduced to the exciting fi eld of algebraic geometric coding theory. Presenting the material in the same conversational tone of the lectures, the author covers linear codes, including cyclic codes, and both bounds and asymptotic bounds on the parameters of codes. Algebraic geometry is introduced, with particular attention given to projective curves, rational functions and divisors. The construction of algebraic geometric codes is given, and the Tsfasman-Vladut-Zink result mentioned above is discussed

Generalized Reed-Muller codes and curves with many points

The weight hierarchy of generalized Reed-Muller codes over arbitrary finite fields was determined by Heijnen and Pellikaan. In this paper we produce curves over finite fields with many points which are closely related to this weight hierarchy.Comment: Plain Tex, 11 page

Quadratic forms, generalized Hamming weights of codes and curves with many points

We use the relations between quadrics, trace codes and algebraic curves to construct algebraic curves over finite fields with many points and to compute generalized Hamming weights of codes.Comment: 14 pages, Plain Te

Good Codes From Generalised Algebraic Geometry Codes

Algebraic geometry codes or Goppa codes are defined with places of degree one. In constructing generalised algebraic geometry codes places of higher degree are used. In this paper we present 41 new codes over GF(16) which improve on the best known codes of the same length and rate. The construction method uses places of small degree with a technique originally published over 10 years ago for the construction of generalised algebraic geometry codes.Comment: 3 pages, to be presented at the IEEE Symposium on Information Theory (ISIT 2010) in Austin, Texas, June 201

Codes, Cryptography, and the McEliece Cryptosystem

Over the past several decades, technology has continued to develop at an incredible rate, and the importance of properly securing information has increased significantly. While a variety of encryption schemes currently exist for this purpose, a number of them rely on problems, such as integer factorization, that are not resistant to quantum algorithms. With the reality of quantum computers approaching, it is critical that a quantum-resistant method of protecting information is found. After developing the proper background, we evaluate the potential of the McEliece cryptosystem for use in the post-quantum era by examining families of algebraic geometry codes that allow for increased security. Finally, we develop a family of twisted Hermitian codes that meets the criteria set forth for security

Weight distribution of cyclic codes defined by quadratic forms and related curves

We consider cyclic codes CL associated to quadratic trace forms inm variables (Formula Presented) determined by a family L of q-linearized polynomials R over Fqm, and three related codes CL,0, CL,1, and CL,2. We describe the spectra for all these codes when L is an even rank family, in terms of the distribution of ranks of the forms QR in the family L, and we also computethe complete weight enumerator for CL. In particular, considering the family L = ‹xql›, with l fixed in N, we give the weight distribution of four parametrized families of cyclic codes Cl, Cl,0,Cl,1, and Cl,2 over Fq with zeros(Formula Presented) respectively,where q = ps with p prime, α is a generator of F*qm, and m/(m,l)is even. Finally, we give simple necessary and sufficient conditions for Artin–Schreier curves yp−y = xR(x)+βx, p prime, associated to polynomials R ∈ L to be optimal. We then obtain several maximal and minimal such curves inthe case (Formula Presented).Fil: Podesta, Ricardo Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Centro de Investigación y Estudios de Matemática. Universidad Nacional de Córdoba. Centro de Investigación y Estudios de Matemática; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; ArgentinaFil: Videla Guzman, Denis Eduardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Centro de Investigación y Estudios de Matemática. Universidad Nacional de Córdoba. Centro de Investigación y Estudios de Matemática; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentin