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