Decoding Square-Free Goppa Codes Over \BBF

We propose a new, efficient nondeterministic decoding algorithm for square-free Goppa codes over F p for any prime p. If the code in question has degree t and the average distance to the closest codeword is at least (4/p)t + 1, the proposed decoder can uniquely correct up to (2/p)t errors with high...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on information theory Ročník 59; číslo 10; s. 6851 - 6858
Hlavní autoři: Barreto, Paulo S. L. M., Misoczki, Rafael, Lindner, Richard
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.10.2013
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Coding theory
Cryptography
Decoding
error correction
Goppa codes
Information theory
Lattices
Polynomials
Probability
Proposals
Vectors
ISSN:0018-9448, 1557-9654
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We propose a new, efficient nondeterministic decoding algorithm for square-free Goppa codes over F p for any prime p. If the code in question has degree t and the average distance to the closest codeword is at least (4/p)t + 1, the proposed decoder can uniquely correct up to (2/p)t errors with high probability. The correction capability is higher if the distribution of error magnitudes is not uniform, approaching or reaching t errors when any particular error value occurs much more often than others or exclusively. This makes the method interesting for (semantically secure) cryptosystems based on the decoding problem for permuted and punctured Goppa codes.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2013.2270272