Simplified High-Speed High-Distance List Decoding for Alternant Codes
From MaRDI portal
Recommendations
- Fast and Flexible Successive-Cancellation List Decoders for Polar Codes
- Efficient List Decoding of Explicit Codes with Optimal Redundancy
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
- List-Decoding Algorithms for Lifted Codes
- Almost disjunctive list-decoding codes
- Efficient list decoding of a class of algebraic-geometry codes
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
Cites work
- scientific article; zbMATH DE number 4132244 (Why is no real title available?)
- scientific article; zbMATH DE number 3147923 (Why is no real title available?)
- scientific article; zbMATH DE number 5532109 (Why is no real title available?)
- scientific article; zbMATH DE number 3458474 (Why is no real title available?)
- scientific article; zbMATH DE number 3480475 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 2151192 (Why is no real title available?)
- scientific article; zbMATH DE number 1825622 (Why is no real title available?)
- scientific article; zbMATH DE number 2118485 (Why is no real title available?)
- scientific article; zbMATH DE number 5486283 (Why is no real title available?)
- A Class of Error-Correcting Codes in $p^m $ Symbols
- Advances in cryptology -- EUROCRYPT '96. International conference on the theory and application of cryptographic techniques, Saragossa, Spain, May 12-16, 1996. Proceedings
- Algebraic coding theory
- Algebraic generalization of BCH-Goppa-Helgert codes
- Alternant codes
- Attacking and Defending the McEliece Cryptosystem
- Coding and cryptology. Third international workshop, IWCC 2011, Qingdao, China, May 30 -- June 3, 2011. Proceedings
- Decoding Square-Free Goppa Codes Over $\BBF_{p}$
- Decoding of Reed Solomon codes beyond the error-correction bound
- Efficient Interpolation in the Guruswami–Sudan Algorithm
- Factoring \(pq ^{2}\) with quadratic forms: Nice cryptanalyses
- Fast multiplication and its applications
- Finding a small root of a bivariate integer equation; factoring with high bits known
- Finding a small root of a univariate modular equation
- Finding smooth integers in short intervals using CRT decoding
- Finding smooth integers in short intervals using CRT decoding
- Further results on Goppa codes and their applications to constructing efficient binary codes
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Key equations for list decoding of Reed-Solomon codes and how to solve them
- Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes
- List Decoding for Binary Goppa Codes
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- On Hensel factorization. I
- On a class of error correcting binary group codes
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- On the complexity of decoding Goppa codes (Corresp.)
- On the complexity of decoding Reed-Solomon codes (Corresp.)
- Polynomial Codes Over Certain Finite Fields
- Post-quantum cryptography. Second international workshop, PQCrypto 2008, Cincinnati, OH, USA, October 17--19, 2008. Proceedings
- Selected areas in cryptography. 17th international workshop, SAC 2010, Waterloo, Ontario, Canada, August 12--13, 2010. Revised selected papers
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Solving Simultaneous Modular Equations of Low Degree
- Wild McEliece
Cited in
(4)
This page was built for publication: Simplified High-Speed High-Distance List Decoding for Alternant Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3102792)
