Linear complexity profile of m-ary pseudorandom sequences with small correlation measure*
暂无分享,去创建一个
[1] Arne Winterhof,et al. LINEAR COMPLEXITY AND RELATED COMPLEXITY MEASURES , 2010 .
[2] Rudolf Ahlswede,et al. Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part I , 2006, GTIT-C.
[3] C. Ding,et al. Stream Ciphers and Number Theory , 1998 .
[4] W. Schmidt. Equations over Finite Fields: An Elementary Approach , 1976 .
[5] I Woungang,et al. Selected topics in information and coding theory , 2010 .
[6] Radwa Marzouk,et al. On the pseudorandomness of binary and quaternary sequences linked by the gray mapping , 2010, Period. Math. Hung..
[7] Arne Winterhof,et al. Linear complexity profile of binary sequences with small correlation measure , 2006, Period. Math. Hung..
[8] Bérczi Gergely. On finite pseudorandom sequences of k symbols , 2003 .
[9] H. Iwaniec,et al. Analytic Number Theory , 2004 .
[10] András Sárközy,et al. On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol , 1997 .
[11] Harald Niederreiter,et al. Linear Complexity and Related Complexity Measures for Sequences , 2003, INDOCRYPT.
[12] Rudolf Ahlswede,et al. General Theory of Information Transfer and Combinatorics (Lecture Notes in Computer Science) , 2007 .
[13] Christian Mauduit,et al. On finite pseudorandom sequences of k symbols , 2002 .