The following pages link to Daniel Augot (Q733501):
Displaying 11 items.
- On the decoding of binary cyclic codes with the Newton identities (Q733502) (← links)
- On the computation of minimal polynomials, cyclic vectors, and Frobenius forms (Q1361771) (← links)
- Description of minimum weight codewords of cyclic codes by algebraic systems (Q1383493) (← links)
- Generalized Gabidulin codes over fields of any characteristic (Q1650439) (← links)
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes (Q2692970) (← links)
- A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes (Q2705986) (← links)
- Diffusion Matrices from Algebraic-Geometry Codes with Efficient SIMD Implementation (Q2798617) (← links)
- Direct Construction of Recursive MDS Diffusion Layers Using Shortened BCH Codes (Q2946900) (← links)
- (Q3102714) (← links)
- On Constructing Homomorphic Encryption Schemes from Coding Theory (Q3104683) (← links)
- Ensuring Message Embedding in Wet Paper Steganography (Q3104699) (← links)
