On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two

Ana Salagean. On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two. In Tor Helleseth, Dilip V. Sarwate, Hong-Yeop Song, Kyeongcheol Yang, editors, Sequences and Their Applications - SETA 2004, Third International Conference, Seoul, Korea, October 24-28, 2004, Revised Selected Papers. Volume 3486 of Lecture Notes in Computer Science, pages 179-184, Springer, 2004. [doi]

@inproceedings{Salagean04,
  title = {On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two},
  author = {Ana Salagean},
  year = {2004},
  doi = {10.1007/11423461_11},
  url = {http://dx.doi.org/10.1007/11423461_11},
  researchr = {https://researchr.org/publication/Salagean04},
  cites = {0},
  citedby = {0},
  pages = {179-184},
  booktitle = {Sequences and Their Applications - SETA 2004, Third International Conference, Seoul, Korea, October 24-28, 2004, Revised Selected Papers},
  editor = {Tor Helleseth and Dilip V. Sarwate and Hong-Yeop Song and Kyeongcheol Yang},
  volume = {3486},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-26084-6},
}