The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Wilfried Meidl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Wilfried Meidl, Arne Winterhof
    On the Autocorrelation of Cyclotomic Generators. [Citation Graph (0, 0)][DBLP]
    International Conference on Finite Fields and Applications, 2003, pp:1-11 [Conf]
  2. Nina Brandstätter, Wilfried Meidl
    On the Linear Complexity of Sidel'nikov Sequences over Fd. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:47-60 [Conf]
  3. Wilfried Meidl
    Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences. [Citation Graph (0, 0)][DBLP]
    SETA, 2004, pp:101-112 [Conf]
  4. Wilfried Meidl
    Continued fraction for formal laurent series and the lattice structure of sequences. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2006, v:17, n:1, pp:29-39 [Journal]
  5. Wilfried Meidl, Harald Niederreiter
    Periodic Sequences with Maximal Linear Complexity and Large k-Error Linear Complexity. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2003, v:14, n:4, pp:273-286 [Journal]
  6. Wilfried Meidl, Arne Winterhof
    A Polynomial Representation of the Diffie-Hellman Mapping. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2002, v:13, n:4, pp:313-318 [Journal]
  7. Wilfried Meidl
    How Many Bits have to be Changed to Decrease the Linear Complexity?. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:33, n:2, pp:109-122 [Journal]
  8. Wilfried Meidl, Arne Winterhof
    Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2006, v:38, n:2, pp:159-178 [Journal]
  9. Wilfried Meidl, Ayineedi Venkateswarlu
    Remarks on the k-error linear complexity of pn-periodic sequences. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2007, v:42, n:2, pp:181-193 [Journal]
  10. Wilfried Meidl, Arne Winterhof
    On the linear complexity profile of explicit nonlinear pseudorandom numbers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:1, pp:13-18 [Journal]
  11. Wilfried Meidl
    Enumeration results on linear complexity profiles and lattice profiles. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2006, v:22, n:2, pp:275-286 [Journal]
  12. Wilfried Meidl, Harald Niederreiter
    Linear Complexity, k-Error Linear Complexity, and the Discrete Fourier Transform. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:1, pp:87-103 [Journal]
  13. Wilfried Meidl, Harald Niederreiter
    The expected value of the joint linear complexity of periodic multisequences. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2003, v:19, n:1, pp:61-72 [Journal]
  14. Wilfried Meidl, Arne Winterhof
    On the linear complexity profile of some new explicit inversive pseudorandom numbers. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2004, v:20, n:2-3, pp:350-355 [Journal]
  15. Wilfried Meidl, Arne Winterhof
    On the joint linear complexity profile of explicit inversive multisequences. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:3, pp:324-336 [Journal]
  16. Wilfried Meidl, Harald Niederreiter, Ayineedi Venkateswarlu
    Error linear complexity measures for multisequences. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2007, v:23, n:2, pp:169-192 [Journal]
  17. Wilfried Meidl
    Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2045-2051 [Journal]
  18. Wilfried Meidl
    On the stability of 2/sup n/-periodic binary sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:3, pp:1151-1155 [Journal]
  19. Wilfried Meidl, Harald Niederreiter
    On the expected value of the linear complexity and the k-error linear complexity ofperiodic sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:11, pp:2817-2825 [Journal]
  20. Wilfried Meidl, Arne Winterhof
    Lower bounds on the linear complexity of the discrete logarithm in finite fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2807-2811 [Journal]

  21. Generalized Joint Linear Complexity of Linear Recurring Multisequences. [Citation Graph (, )][DBLP]


  22. Reducing the calculation of the linear complexity of u 2 v -periodic binary sequences to Games-Chan algorithm. [Citation Graph (, )][DBLP]


  23. Remarks on a cyclotomic sequence. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002