Wilfried Meidl
Orcid: 0000-0002-6270-7605
According to our database1,
Wilfried Meidl
authored at least 89 papers
between 2001 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2025
IEEE Trans. Inf. Theory, January, 2025
2024
IEEE Trans. Inf. Theory, December, 2024
CoRR, 2024
2023
Cryptogr. Commun., December, 2023
Discret. Math., 2023
2022
IEEE Trans. Inf. Theory, 2022
2021
IEEE Trans. Inf. Theory, 2021
Des. Codes Cryptogr., 2021
2020
Vanishing Flats: A Combinatorial Viewpoint on the Planarity of Functions and Their Application.
IEEE Trans. Inf. Theory, 2020
CoRR, 2020
Cryptogr. Commun., 2020
Cryptogr. Commun., 2020
2019
Finite Fields Their Appl., 2019
Discret. Appl. Math., 2019
Generalized bent functions into ℤ p k $\mathbb {Z}_{p^{k}}$ from the partial spread and the Maiorana-McFarland class.
Cryptogr. Commun., 2019
2018
Full Characterization of Generalized Bent Functions as (Semi)-Bent Spaces, Their Dual, and the Gray Image.
IEEE Trans. Inf. Theory, 2018
Math. Comput. Simul., 2018
Bent and vectorial bent functions, partial difference sets, and strongly regular graphs.
Adv. Math. Commun., 2018
Proceedings of the Arithmetic of Finite Fields - 7th International Workshop, 2018
2017
Finite Fields Their Appl., 2017
Idempotent and p-potent quadratic functions: distribution of nonlinearity and co-dimension.
Des. Codes Cryptogr., 2017
2016
IEEE Trans. Inf. Theory, 2016
J. Comb. Theory A, 2016
Cryptogr. Commun., 2016
Proceedings of the Arithmetic of Finite Fields - 6th International Workshop, 2016
2015
Appl. Algebra Eng. Commun. Comput., 2015
2014
IEEE Trans. Inf. Theory, 2014
J. Comput. Appl. Math., 2014
Finite Fields Their Appl., 2014
Proceedings of the Applied Algebra and Number Theory, 2014
2013
Finite Fields Their Appl., 2013
Des. Codes Cryptogr., 2013
Adv. Math. Commun., 2013
Linear complexity of sequences and multisequences.
Proceedings of the Handbook of Finite Fields., 2013
2012
J. Comb. Theory A, 2012
2010
A General Approach to Construction and Determination of the Linear Complexity of Sequences Based on Cosets.
Proceedings of the Sequences and Their Applications - SETA 2010, 2010
2009
Linear complexity over F<sub>q</sub> and over F<sub>q<sup>m</sup></sub> for linear recurring sequences.
Finite Fields Their Appl., 2009
How to determine linear complexity and <i>k</i>-error linear complexity in some classes of linear recurring sequences.
Cryptogr. Commun., 2009
2008
J. Complex., 2008
Reducing the calculation of the linear complexity of <i>u</i> 2<sup> <i>v</i> </sup>-periodic binary sequences to Games-Chan algorithm.
Des. Codes Cryptogr., 2008
Proceedings of the Sequences and Their Applications, 2008
2007
On the Linear Complexity and k-Error Linear Complexity Over BBF<sub>p</sub> of the d-ary Sidel'nikov Sequence.
IEEE Trans. Inf. Theory, 2007
On the linear complexity profile of nonlinear congruential pseudorandom number generators with Rédei functions.
Finite Fields Their Appl., 2007
Remarks on the <i>k</i>-error linear complexity of <i>p</i><sup><i>n</i></sup>-periodic sequences.
Des. Codes Cryptogr., 2007
2006
J. Complex., 2006
Des. Codes Cryptogr., 2006
Appl. Algebra Eng. Commun. Comput., 2006
Proceedings of the Sequences and Their Applications, 2006
2005
IEEE Trans. Inf. Theory, 2005
J. Complex., 2005
2004
On the linear complexity profile of some new explicit inversive pseudorandom numbers.
J. Complex., 2004
Finite Fields Their Appl., 2004
Des. Codes Cryptogr., 2004
Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences.
Proceedings of the Sequences and Their Applications, 2004
2003
Theor. Comput. Sci., 2003
J. Complex., 2003
Inf. Process. Lett., 2003
Periodic Sequences with Maximal Linear Complexity and Large k-Error Linear Complexity.
Appl. Algebra Eng. Commun. Comput., 2003
Proceedings of the Finite Fields and Applications, 2003
2002
On the expected value of the linear complexity and the k-error linear complexity ofperiodic sequences.
IEEE Trans. Inf. Theory, 2002
Linear Complexity, <i>k</i>-Error Linear Complexity, and the Discrete Fourier Transform.
J. Complex., 2002
Appl. Algebra Eng. Commun. Comput., 2002
2001
IEEE Trans. Inf. Theory, 2001