Two decoding algorithms for linear codes

zbMath0708.94017MaRDI QIDQ920927

I. I. Dumer

Publication date: 1989

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

linear codesdecoding algorithms

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Related Items (13)

Information set decoding in the Lee metric with applications to cryptography ⋮ Structural properties of self-dual monomial codes with application to code-based cryptography ⋮ 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 ⋮ Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation ⋮ On the complexity of suboptimal decoding for list and decision feedback schemes ⋮ \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

This page was built for publication: Two decoding algorithms for linear codes