Understanding binary-Goppa decoding
From MaRDI portal
Cites work
- A Class of Error-Correcting Codes in p^m Symbols
- A method for solving key equation for decoding goppa codes
- A New Algorithm for Decoding Reed-Solomon Codes
- Advances in cryptology - ASIACRYPT '98. International conference on the Theory and application of cryptology and information security, Beijing, China, October 18--22, 1998. Proceedings
- Algebraic coding theory
- Automated deduction -- CADE 28. 28th international conference on automated deduction, virtual event, July 12--15, 2021. Proceedings
- BLAKE-512-Based 128-Bit CCA2 Secure Timing Attack Resistant McEliece Cryptoprocessor
- Candle: a verified implementation of HOL light
- Code-based cryptography
- Code-based cryptography. 10th international workshop, CBCrypto 2022, Trondheim, Norway, May 29--30, 2022. Revised selected papers
- Communications, Information and Network Security
- Continued fractions and Berlekamp's algorithm
- Continued Fractions and Linear Recurrences
- Cryptographic hardware and embedded systems -- CHES 2013. 15th international workshop, Santa Barbara, CA, USA, August 20--23, 2013. Proceedings
- Cryptographic hardware and embedded systems -- CHES 2017. 19th international conference, Taipei, Taiwan, September 25--28, 2017. Proceedings
- Decoding of redundant residue polynomial codes using Euclid's algorithm
- Decoding of Reed Solomon codes beyond the error-correction bound
- Encoding and error-correction procedures for the Bose-Chaudhuri codes
- Fast multiplication and its applications
- Finding smooth integers in short intervals using CRT decoding
- Finding smooth integers in short intervals using CRT decoding
- Formal methods in computer-aided design. 1st international conference, FMCAD '96, Palo Alto, CA, USA, November 6--8, 1996. Proceedings
- Gaussian elimination is not optimal
- scientific article; zbMATH DE number 5532109 (Why is no real title available?)
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 3471564 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 1825622 (Why is no real title available?)
- scientific article; zbMATH DE number 7573871 (Why is no real title available?)
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- Improved decoding of Reed-Solomon and algebraic-geometric codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- List Decoding for Binary Goppa Codes
- McBits: fast constant-time code-based cryptography
- On decoding BCH codes
- On the approximate representation of a function by rational functions.
- On the complexity of decoding Goppa codes (Corresp.)
- On the complexity of decoding Reed-Solomon codes (Corresp.)
- On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
- Polynomial Codes Over Certain Finite Fields
- Post-Quantum Cryptography
- Post-quantum cryptography. 4th international workshop, PQCrypto 2011, Taipei, Taiwan, November 29--December 2, 2011. Proceedings
- Selected areas in cryptography. 17th international workshop, SAC 2010, Waterloo, Ontario, Canada, August 12--13, 2010. Revised selected papers
- Shift-register synthesis and BCH decoding
- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- The algebraic decoding of Goppa codes
- The Lean 4 theorem prover and programming language
- Wild McEliece
- Zur Theorie der Elimination einer Variabeln aus zwei algebraischen Gleichungen.
Cited in
(2)
This page was built for publication: Understanding binary-Goppa decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318559)
