Reducing the calculation of the linear complexity of u 2 v -periodic binary sequences to Games-Chan algorithm

@article{Meidl2008ReducingTC,
  title={Reducing the calculation of the linear complexity of u 2 v -periodic binary sequences to Games-Chan algorithm},
  author={Wilfried Meidl},
  journal={Des. Codes Cryptography},
  year={2008},
  volume={46},
  pages={57-65}
}
We show that the linear complexity of a u2-periodic binary sequence, u odd, can easily be calculated from the linear complexities of certain 2-periodic binary sequences. Since the linear complexity of a 2-periodic binary sequence can efficiently be calculated with the Games-Chan algorithm, this leads to attractive procedures for the determination of the linear complexity of a u2-periodic binary sequence. Realizations are presented for u = 3, 5, 7, 15. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

Fast algorithms for determining the linear complexity of sequences over GF(pm) with period 2t n

  • H. Chen
  • IEEE Trans. Inform. Theory 51, –1856
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…