According to our database
1,
Daqing Wan
authored at least 48 papers
between 1997 and 2023.
Collaborative distances:
2023
In Memory of Professor Zhexian Wan.
Finite Fields Their Appl., December, 2023
Divisibility on point counting over finite Witt rings.
Finite Fields Their Appl., October, 2023
On Deep Holes of Elliptic Curve Codes.
IEEE Trans. Inf. Theory, July, 2023
2022
Computing zeta functions of large polynomial systems over finite fields.
J. Complex., 2022
2021
Exponential Sums over Finite Fields.
J. Syst. Sci. Complex., 2021
2020
Deep Holes of Projective Reed-Solomon Codes.
IEEE Trans. Inf. Theory, 2020
Distance Distribution in Reed-Solomon Codes.
IEEE Trans. Inf. Theory, 2020
Moment subset sums over finite fields.
Finite Fields Their Appl., 2020
Rational points on complete symmetric hypersurfaces over finite fields.
Discret. Math., 2020
2018
On deep holes of Gabidulin codes.
Finite Fields Their Appl., 2018
Distance Distribution to Received Words in Reed-Solomon Codes.
CoRR, 2018
On lattice-based algebraic feedback shift registers synthesis for multisequences.
Cryptogr. Commun., 2018
2017
Sparse univariate polynomials with many roots over finite fields.
Finite Fields Their Appl., 2017
Explicit Deep Holes of Reed-Solomon Codes.
CoRR, 2017
Counting Roots of Polynomials Over Prime Power Rings.
CoRR, 2017
2016
A refinement of multivariate value set bounds.
Finite Fields Their Appl., 2016
Deep holes in Reed-Solomon codes based on Dickson polynomials.
Finite Fields Their Appl., 2016
Index bounds for character sums of polynomials over finite fields.
Des. Codes Cryptogr., 2016
On deep holes of projective Reed-Solomon codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016
2015
Linearized Wenger graphs.
Discret. Math., 2015
Index bounds for character sums with polynomials over finite fields.
CoRR, 2015
On the minimum distance of elliptic curve codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015
2014
Stopping Sets of Algebraic Geometry Codes.
IEEE Trans. Inf. Theory, 2014
Traps to the BGJT-algorithm for discrete logarithms.
LMS J. Comput. Math., 2014
Algebraic Cayley graphs over finite fields.
Finite Fields Their Appl., 2014
Index bounds for value sets of polynomials over finite fields.
Proceedings of the Applied Algebra and Number Theory, 2014
2013
Computing the number of rational points and zeta functions.
Proceedings of the Handbook of Finite Fields., 2013
Proceedings of the Handbook of Finite Fields., 2013
2012
A Deterministic Reduction for the Gap Minimum Distance Problem.
IEEE Trans. Inf. Theory, 2012
Counting subset sums of finite abelian groups.
J. Comb. Theory, Ser. A, 2012
An asymptotic formula for counting subset sums over subgroups of finite fields.
Finite Fields Their Appl., 2012
Computing Error Distance of Reed-Solomon Codes.
Proceedings of the Theory and Applications of Models of Computation, 2012
Stopping Set Distributions of Algebraic Geometry Codes from Elliptic Curves.
Proceedings of the Theory and Applications of Models of Computation, 2012
Constructing high order elements through subspace polynomials.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
2011
Counting Value Sets: Algorithm and Complexity
CoRR, 2011
2010
Complexity of decoding positive-rate primitive Reed-Solomon codes.
IEEE Trans. Inf. Theory, 2010
2009
Primary decomposition of zero-dimensional ideals over finite fields.
Math. Comput., 2009
A deterministic reduction for the gap minimum distance problem: [extended abstract].
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009
2008
Modular Counting of Rational Points over Finite Fields.
Found. Comput. Math., 2008
On the subset sum problem over finite fields.
Finite Fields Their Appl., 2008
Trivial factors for L-functions of symmetric products of Kloosterman sheaves.
Finite Fields Their Appl., 2008
Complexity of Decoding Positive-Rate Reed-Solomon Codes.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
2007
On the List and Bounded Distance Decodability of Reed-Solomon Codes.
SIAM J. Comput., 2007
2006
Combinatorial congruences and psi-operators.
Finite Fields Their Appl., 2006
2004
Computing zeta functions of Artin-Schreier curves over finite fields II.
J. Complex., 2004
On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract).
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
2002
Computing Zeta Functions of Artin-schreier Curves over Finite Fields.
LMS J. Comput. Math., 2002
1997
Generators and irreducible polynomials over finite fields.
Math. Comput., 1997
