home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.crypt
- Path: sparky!uunet!haven.umd.edu!darwin.sura.net!europa.asd.contel.com!NewsWatcher!user
- From: levesque@rocky.ndhm.gtegsc.com (Allen Levesque)
- Subject: Decoding Goppa codes
- Message-ID: <levesque-250193160204@192.147.5.16>
- Followup-To: Inquiry re Goppa Codes
- Sender: news@europa.asd.contel.com (News)
- Nntp-Posting-Host: rocky.ndhm.gtegsc.com
- Organization: GTE Government Systems
- Date: Mon, 25 Jan 1993 21:02:47 GMT
- Lines: 23
-
- Subject: Decoding Goppa Codes
- Date: January 25, 1993
- From: levesque@rocky.ndhm.gtegsc.com
-
- This is provided in response to an inquiry from Ralf Fessner
- (rf4@irz202.inf.tu-dresden.de) regarding algorithms for decoding Goppa
- codes.
-
- Goppa codes can be decoded in a manner very similar to the decoding of
- BCH codes. In fact the procedure makes use of a form of Berlekamp's
- iterative algorithm for finding the error-location polynomial for a BCH
- code. Two good papers are:
-
- 1. N. J. Patterson, "The Algebraic Decoding of Goppa Codes," IEEE Trans.
- on Inf. Thy., IT-21, pp 203-207, March 1975.
-
- 2. Y. Sugiyama, et. al., "A Method for Solving Key Equations for Decoding
- Goppa Codes," Information and Control, Vol 27, pp 87-89, January 1975.
-
-
- ALLEN LEVESQUE, GTE GOVERNMENT SYSTEMS CORP., WALTHAM, MASS. USA,
- TEL: (617)466-3729, FAX: (617)466-3720, e-mail:
- Levesque@rocky.ndhm.gtegsc.com
-