Improved geometric Goppa codes

Author

Feng, G.L. ; Rao, T.R.N. ; Welch, L.R.

Author_Institution

Center for Adv. Comput. Studies, Southwestern Louisiana Univ., Lafayette, LA, USA

fYear

1994

fDate

27 Jun-1 Jul 1994

Firstpage

152

Abstract

Summary form only given. A new class of geometric Goppa codes are discussed. We show that the improved geometric Goppa codes are more efficient than the current geometric Goppa codes, for many cases. We also show several improved geometric Goppa codes from algebraic curves in high-dimensional spaces, hyperplanes in affine spaces and projective spaces, surfaces in affine spaces, and some varieties generated by algebraic curves. As special cases, the multi-level codes derived by Wu and Costello (see IEEE Trans. Information Theory, vol.IT-38, p.933, 1992), the hyperbolic cascaded Reed-Solomon codes derived by Saints and Heegard (see Lecture Notes in Computer Science 673, p.291, 1993), Chen (1986) codes, and their generalizations can be easily derived

Keywords

Goppa codes; Reed-Solomon codes; geometric codes; affine spaces; algebraic curves; geometric Goppa codes; high-dimensional spaces; hyperbolic cascaded Reed-Solomon codes; hyperplanes; multi-level codes; projective spaces; Computer aided instruction; Computer science; Decoding; Hafnium; Information theory; Linear code; Reed-Solomon codes; USA Councils; Vectors; Voting;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on

Conference_Location

Trondheim

Print_ISBN

0-7803-2015-8

Type

conf

DOI

10.1109/ISIT.1994.394823

Filename

394823