Pages that link to "Item:Q920927"
From MaRDI portal
The following pages link to Two decoding algorithms for linear codes (Q920927):
Displaying 20 items.
- Information set decoding in the Lee metric with applications to cryptography (Q825935) (← links)
- Two decyclical lengthening methods for block codes (Q1069905) (← links)
- Identifying an unknown code by partial Gaussian elimination (Q1727382) (← links)
- Linear codes interpolation from noisy patterns by means of a vector quantization process (Q1905904) (← links)
- Decoding algorithms of monotone codes and azinv codes and their unified view (Q2099156) (← links)
- Structural properties of self-dual monomial codes with application to code-based cryptography (Q2149783) (← links)
- On the complexity of suboptimal decoding for list and decision feedback schemes (Q2489924) (← links)
- Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece'' hardware reference implementation (Q2692373) (← links)
- On two probabilistic decoding algorithms for binary linear codes (Q3987473) (← links)
- Algorithmic issues in coding theory (Q4370031) (← links)
- (Q4494935) (← links)
- Generalization of the Ball-Collision Algorithm (Q5855596) (← links)
- Improved information set decoding algorithms over Galois ring in the Lee metric (Q6131036) (← links)
- Statistical decoding 2.0: reducing decoding to LPN (Q6175988) (← links)
- \textsf{FuLeeca}: a Lee-based signature scheme (Q6550578) (← links)
- A new approach based on quadratic forms to attack the McEliece cryptosystem (Q6604863) (← links)
- Zero knowledge protocols and signatures from the restricted syndrome decoding problem (Q6635771) (← links)
- Reduction from sparse LPN to LPN, dual attack 3.0 (Q6637725) (← links)
- Integer syndrome decoding in the presence of noise (Q6643248) (← links)
- CryptAttackTester: high-assurance attack analysis (Q6652984) (← links)
