Improved geometric Goppa codes. I. Basic theory

  • Authors:
  • Gui-Liang Feng;T. R.N. Rao

  • Affiliations:
  • Center for Adv. Comput. Studies, Univ. of Southwestern Louisiana, Lafayette, LA;-

  • Venue:
  • IEEE Transactions on Information Theory - Part 1
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present a construction of improved geometric Goppa codes which, for the case of r<2g, are often more efficient than the current geometric Goppa codes derived from some varieties, which include algebraic curves, hyperplanes, surfaces, and other varieties. For the special case of a plane in a three-dimensional projective space, the improved geometric Goppa codes are reduced to linear multilevel codes. For these improved geometric Goppa codes, a designed minimum distance can be easily determined and a decoding procedure which corrects up to half the designed minimum distance is also given