Algebraic Coding Theory

  • David Cox
  • John Little
  • Donal O’Shea
Part of the Graduate Texts in Mathematics book series (GTM, volume 185)

Abstract

In this chapter we will discuss some applications of techniques from computational algebra and algebraic geometry to problems in coding theory. After a preliminary section on the arithmetic of finite fields, we will introduce some basic terminology for describing error-correcting codes. We will study two important classes of examples—linear codes and cyclic codes—where the set of codewords possesses additional algebraic structure, and we will use this structure to develop good encoding and decoding algorithms. Finally, we will introduce the Reed-Muller and geometric Goppa codes, where algebraic geometry is used in the construction of the code itself.

Keywords

Finite Field Linear Code Block Length Cyclic Code Hilbert Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • David Cox
    • 1
  • John Little
    • 2
  • Donal O’Shea
    • 3
  1. 1.Department of Mathematics and Computer ScienceAmherst CollegeAmherstUSA
  2. 2.Department of MathematicsCollege of the Holy CrossWorcesterUSA
  3. 3.Department of Mathematics, Statistics and Computer ScienceMount Holyoke CollegeSouth HadleyUSA

Personalised recommendations