Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,434,875 papers from all fields of science
Search
Sign In
Create Free Account
Binary Goppa code
In mathematics and computer science, the binary Goppa code is an error-correcting code that belongs to the class of general Goppa codes originally…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Alternant code
Code rate
Computer science
Cryptography
Expand
Broader (1)
Coding theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Reducing the Key Size of McEliece Cryptosystem from Goppa Codes via Permutations
Zhe Li
,
C. Xing
,
S. Yeo
IACR Cryptology ePrint Archive
2018
Corpus ID: 53236765
In this paper, we propose a new general construction to reduce the public key size of McEliecebased schemes based on Goppa codes…
Expand
2011
2011
How SAGE helps to implement Goppa Codes and McEliece PKCSs
Thomas Risse
2011
Corpus ID: 57508430
Common cryptographic methods, especially Public Key Crypto Systems, PKCS based on difficulty to factor large integers or to…
Expand
2001
2001
Codes Derived from Binary Goppa Codes
P. Loidreau
Problems of Information Transmission
2001
Corpus ID: 18780311
We present a new family of binary codes derived from the family of classical Goppa codes. We generalize properties of Goppa codes…
Expand
Review
1996
Review
1996
Algebraic Function Fields and Codes [Book Reviews]
P. Kumar
IEEE Transactions on Information Theory
1996
Corpus ID: 206736299
1990
1990
Asymptotically good families of geometric Goppa codes and the Gilbert-Varshamov bound
C. Voss
International Symposium on Coding Theory and…
1990
Corpus ID: 6045754
This note presents a generalization of the fact that most of the classical Goppa codes lie arbitrarily close to the Gilbert…
Expand
1984
1984
A [55, 16, 19] binary Goppa code
M. Loeloeian
,
J. Conan
IEEE Transactions on Information Theory
1984
Corpus ID: 6503002
A [55, 16, 19] binary Goppa code and some related codes are described. These codes are found to contain more codewords than any…
Expand
1977
1977
On the complexity of decoding Goppa codes (Corresp.)
D. Sarwate
IEEE Transactions on Information Theory
1977
Corpus ID: 34300025
It is shown that i) erasures-and-errors decoding of Goppa codes can be done using O(n \log^{2} n) arithmetic operations, ii) long…
Expand
1976
1976
Bounds on Goppa codes (Corresp.)
C. Retter
IEEE Transactions on Information Theory
1976
Corpus ID: 30883482
Goppa showed that the performance of most "Goppa codes" approaches the Gilbert bound asymptotically, but their performance for…
Expand
1976
1976
An erasures-and-errors decoding algorithm for Goppa codes (Corresp.)
Y. Sugiyama
,
M. Kasahara
,
S. Hirasawa
,
T. Namekawa
IEEE Transactions on Information Theory
1976
Corpus ID: 44323370
An erasures-and-errors decoding algorithm for Goppa codes is presented. Given the Goppa polynomial and the modified syndrome…
Expand
1975
1975
Cycle representatives for minimal cyclic codes (Corresp.)
Michael Willett
IEEE Transactions on Information Theory
1975
Corpus ID: 206732403
An algorithm is presented for the calculation of a cycle set for any cyclic code which has an irreducible parity-check polynomial…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE