Daniel Augot

Available identifiers

zbMath Open augot.danielMaRDI QIDQ733501

List of research outcomes

Publication	Date of Publication	Type
Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes	2023-03-17	Paper
Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed--Muller Codes	2021-06-03	Paper
Generalized Gabidulin codes over fields of any characteristic	2018-07-03	Paper
An Interpolation Procedure for List Decoding Reed–Solomon Codes Based on Generalized Key Equations	2017-07-12	Paper
Diffusion Matrices from Algebraic-Geometry Codes with Efficient SIMD Implementation	2016-04-13	Paper
Direct Construction of Recursive MDS Diffusion Layers Using Shortened BCH Codes	2015-09-18	Paper
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers	2015-02-10	Paper
https://portal.mardi4nfdi.de/entity/Q4648134	2012-11-08	Paper
Discrete logarithm computations over finite fields using Reed-Solomon codes	2012-02-20	Paper
On Constructing Homomorphic Encryption Schemes from Coding Theory	2011-12-16	Paper
Ensuring Message Embedding in Wet Paper Steganography	2011-12-16	Paper
https://portal.mardi4nfdi.de/entity/Q3102714	2011-12-07	Paper
A Note on the Generalisation of the Guruswami–Sudan List Decoding Algorithm to Reed–Muller Codes	2009-12-16	Paper
An introduction to linear and cyclic codes	2009-12-16	Paper
On the decoding of binary cyclic codes with the Newton identities	2009-10-16	Paper
Progress in Cryptology – Mycrypt 2005	2006-10-05	Paper
https://portal.mardi4nfdi.de/entity/Q4811342	2004-09-06	Paper
https://portal.mardi4nfdi.de/entity/Q4434878	2003-11-26	Paper
A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes	2001-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4950443	2000-03-30	Paper
Description of minimum weight codewords of cyclic codes by algebraic systems	1998-04-26	Paper
On the computation of minimal polynomials, cyclic vectors, and Frobenius forms	1997-12-08	Paper
Bounds on the minimum distance of the duals of BCH codes	1996-09-25	Paper
https://portal.mardi4nfdi.de/entity/Q4291247	1995-01-23	Paper
Idempotents and the BCH bound	1994-10-04	Paper
Studying the locator polynomials of minimum weight codewords of BCH codes	1992-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q5752491	1991-01-01	Paper

Research outcomes over time

This page was built for person: Daniel Augot