Daniel Augot

From MaRDI portal
(Redirected from Person:733501)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Bivariate proximity test-based asynchronous verifiable secret sharing2026-01-08Paper
Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
Designs, Codes and Cryptography
2023-03-17Paper
Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes
SIAM Journal on Applied Algebra and Geometry
2021-06-03Paper
Generalized Gabidulin codes over fields of any characteristic
Designs, Codes and Cryptography
2018-07-03Paper
An Interpolation Procedure for List Decoding Reed–Solomon Codes Based on Generalized Key Equations
IEEE Transactions on Information Theory
2017-07-12Paper
Diffusion matrices from algebraic-geometry codes with efficient SIMD implementation
Selected Areas in Cryptography -- SAC 2014
2016-04-13Paper
Direct construction of recursive MDS diffusion layers using shortened BCH codes
Fast Software Encryption
2015-09-18Paper
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers
Cryptology and Network Security
2015-02-10Paper
scientific article; zbMATH DE number 6103506 (Why is no real title available?)2012-11-08Paper
Discrete logarithm computations over finite fields using Reed-Solomon codes2012-02-20Paper
On constructing homomorphic encryption schemes from coding theory
Cryptography and Coding
2011-12-16Paper
Ensuring Message Embedding in Wet Paper Steganography
Cryptography and Coding
2011-12-16Paper
scientific article; zbMATH DE number 5986690 (Why is no real title available?)2011-12-07Paper
A Note on the Generalisation of the Guruswami–Sudan List Decoding Algorithm to Reed–Muller Codes
Gröbner Bases, Coding, and Cryptography
2009-12-16Paper
An introduction to linear and cyclic codes
Gröbner Bases, Coding, and Cryptography
2009-12-16Paper
On the decoding of binary cyclic codes with the Newton identities
Journal of Symbolic Computation
2009-10-16Paper
Progress in Cryptology – Mycrypt 2005
Lecture Notes in Computer Science
2006-10-05Paper
scientific article; zbMATH DE number 2096586 (Why is no real title available?)2004-09-06Paper
scientific article; zbMATH DE number 2009958 (Why is no real title available?)2003-11-26Paper
A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes
IEEE Transactions on Information Theory
2001-03-19Paper
scientific article; zbMATH DE number 1426187 (Why is no real title available?)2000-03-30Paper
Description of minimum weight codewords of cyclic codes by algebraic systems
Finite Fields and their Applications
1998-04-26Paper
On the computation of minimal polynomials, cyclic vectors, and Frobenius forms
Linear Algebra and its Applications
1997-12-08Paper
Bounds on the minimum distance of the duals of BCH codes
IEEE Transactions on Information Theory
1996-09-25Paper
scientific article; zbMATH DE number 563668 (Why is no real title available?)1995-01-23Paper
Idempotents and the BCH bound
IEEE Transactions on Information Theory
1994-10-04Paper
Studying the locator polynomials of minimum weight codewords of BCH codes
IEEE Transactions on Information Theory
1992-09-27Paper
scientific article; zbMATH DE number 4187714 (Why is no real title available?)1991-01-01Paper


Research outcomes over time


This page was built for person: Daniel Augot