1. Dai, Z.-D.: Binary sequences derived from ML-sequences over rings I: period and minimal polynomial. J. Cryptology 5, 193–507 (1992)

   Article MATH MathSciNet  Google Scholar 

2. Dai, Z.-D., Dingfeng, Y., Ping, W., Genxi, F.: Distribution ofr −patterns in the highest level ofp −adic sequences over Galois Rings. In: Golomb Symposium USC 2002 (2002)

   Google Scholar 

3. Davenport, H.: Multiplicative Number Theory, GTM 74. Springer, Heidelberg (2000)

   Google Scholar 

4. Fan, S., Han, W.: Random properties of the highest level sequences of primitive Sequences over\({\mathbb Z}_{2^e}\). IEEE Trans. Inform. Theory IT-49, 1553–1557 (2003)

   MathSciNet  Google Scholar 

5. Helleseth, T., Kumar, P.V.: Sequences with low Correlation. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, vol. II, pp. 1765–1853. North Holland, Amsterdam (1998)

   Google Scholar 

6. Kumar, P.V., Helleseth, T.: An expansion of the coordinates of the trace function over Galois rings. AAECC 8, 353–361 (1997)

   Article MATH MathSciNet  Google Scholar 

7. Kumar, P.V., Helleseth, T., Calderbank, A.R.: An upper bound for Weil exponential sums over Galois rings and applications. IEEE Trans. Inform. Theory IT-41, 456–468 (1995)

   Article MathSciNet  Google Scholar 

8. Lahtonen, J.: On the odd and the aperiodic correlation properties of the binary Kasami sequences. IEEE Trans. Inform. Theory IT-41, 1506–1508 (1995)

   Article MathSciNet  Google Scholar 

9. Lahtonen, J., Ling, S., Solé, P., Zinoviev, D.:\({\mathbb Z}_8\)-Kerdock codes and pseudo-random binary sequences. Journal of Complexity 20(2-3), 318–330 (2004)

   Article MATH MathSciNet  Google Scholar 

10. Solé, P., Zinoviev, D.: The most significant bit of maximum length sequences over\({\mathbb Z}_{2^l}\) autocorrection and imbalance. IEEE IT (2004) (in press)

    Google Scholar 

Download references