Back to Search
Start Over
Goppa codes
- Source :
- IEEE Transactions on Information Theory. 19:590-592
- Publication Year :
- 1973
- Publisher :
- Institute of Electrical and Electronics Engineers (IEEE), 1973.
-
Abstract
- Goppa described a new class of linear noncyclic error-correcting codes in [1] and [2]. This paper is a summary of Goppa's work, which is not yet available in English. ^1 We prove the four most important properties of Goppa codes. 1) There exist q -ary Goppa codes with lengths and redundancies comparable to BCH codes. For the same redundancy, the Goppa code is typically one digit longer. 2) All Goppa codes have an algebraic decoding algorithm which will correct up to a certain number of errors, comparable to half the designed distance of BCH codes. 3) For binary Goppa codes, the algebraic decoding algorithm assumes a special form. 4) Unlike primitive BCH codes, which are known to have actual distances asymptotically equal to their designed distances, long Goppa codes have actual minimum distances much greater than twice the number of errors, which are guaranteed to be correctable by the algebraic decoding algorithm. In fact, long irreducible Goppa codes asymptotically meet the Gilbert bound.
- Subjects :
- Block code
Discrete mathematics
Error floor
Binary number
Data_CODINGANDINFORMATIONTHEORY
Library and Information Sciences
Computer Science Applications
Combinatorics
Redundancy (information theory)
Goppa code
Algebraic decoding
BCH code
Computer Science::Cryptography and Security
Computer Science::Information Theory
Information Systems
Mathematics
Subjects
Details
- ISSN :
- 00189448
- Volume :
- 19
- Database :
- OpenAIRE
- Journal :
- IEEE Transactions on Information Theory
- Accession number :
- edsair.doi...........4e499a995090c8067b4af3df0cd5d4bb