Decoding Geometric Goppa Codes

Serguei A. Stepanov
Additional contact information
Serguei A. Stepanov: Bilkent University

Chapter Chapter 12 in Codes on Algebraic Curves, 1999, pp 289-314 from Springer

Abstract: Abstract This chapter concerns the decoding problem for geometric Goppa codes. We consider various aspects of the problem beginning with results on the existence of decoding algorithms and ending with ones on the construction of efficient algorithms which can easily be used in practice. For a detailed treatment of the complexity of algorithms we refer the reader to Aho, Hoperoft and Ulman [2].

Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4615-4785-3_12

Ordering information: This item can be ordered from
http://www.springer.com/9781461547853

DOI: 10.1007/978-1-4615-4785-3_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().