On the Autocorrelation and the Linear Complexity of ::::q::::-Ary Prime ::::n::::-Square Sequences

Fang Liu, Daiyuan Peng, Xiaohu Tang, Xianhua Niu. On the Autocorrelation and the Linear Complexity of ::::q::::-Ary Prime ::::n::::-Square Sequences. In Claude Carlet, Alexander Pott, editors, Sequences and Their Applications - SETA 2010 - 6th International Conference, Paris, France, September 13-17, 2010. Proceedings. Volume 6338 of Lecture Notes in Computer Science, pages 139-150, Springer, 2010. [doi]

@inproceedings{LiuPTN10-0,
  title = {On the Autocorrelation and the Linear Complexity of ::::q::::-Ary Prime ::::n::::-Square Sequences},
  author = {Fang Liu and Daiyuan Peng and Xiaohu Tang and Xianhua Niu},
  year = {2010},
  doi = {10.1007/978-3-642-15874-2_11},
  url = {http://dx.doi.org/10.1007/978-3-642-15874-2_11},
  researchr = {https://researchr.org/publication/LiuPTN10-0},
  cites = {0},
  citedby = {0},
  pages = {139-150},
  booktitle = {Sequences and Their Applications - SETA 2010 - 6th International Conference, Paris, France, September 13-17, 2010. Proceedings},
  editor = {Claude Carlet and Alexander Pott},
  volume = {6338},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-15873-5},
}