Two decoding algorithms for linear codes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3963726
- On computing nearest neighbors with applications to decoding of binary linear codes
- scientific article; zbMATH DE number 4189649
- scientific article; zbMATH DE number 2077078
- Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes (Corresp.)
Cited in
(30)- Two decyclical lengthening methods for block codes
- Identifying an unknown code by partial Gaussian elimination
- Linear codes interpolation from noisy patterns by means of a vector quantization process
- Decoding algorithms of monotone codes and azinv codes and their unified view
- Structural properties of self-dual monomial codes with application to code-based cryptography
- On the complexity of suboptimal decoding for list and decision feedback schemes
- Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation
- Complexity of Elias algorithm based on codes with covering radius three
- On computing nearest neighbors with applications to decoding of binary linear codes
- scientific article; zbMATH DE number 3963726 (Why is no real title available?)
- On two probabilistic decoding algorithms for binary linear codes
- A new approach to error-correcting codes
- scientific article; zbMATH DE number 1486636 (Why is no real title available?)
- scientific article; zbMATH DE number 1420952 (Why is no real title available?)
- scientific article; zbMATH DE number 4189649 (Why is no real title available?)
- Generalization of the ball-collision algorithm
- Improved information set decoding algorithms over Galois ring in the Lee metric
- Statistical decoding 2.0: reducing decoding to LPN
- \textsf{FuLeeca}: a Lee-based signature scheme
- A new approach based on quadratic forms to attack the McEliece cryptosystem
- Zero knowledge protocols and signatures from the restricted syndrome decoding problem
- Reduction from sparse LPN to LPN, dual attack 3.0
- Integer syndrome decoding in the presence of noise
- CryptAttackTester: high-assurance attack analysis
- The quantum decoding problem
- Increasing index sizes for information set decoding algorithms
- Quadratic modelings of syndrome decoding
- A new path to code-based signatures via identification schemes with restricted errors
- On the matrix code of quadratic relationships for a Goppa code
- Information set decoding in the Lee metric with applications to cryptography
This page was built for publication: Two decoding algorithms for linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q920927)
