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. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
