On the Linear Complexity of Ding-Helleseth Generalized Cyclotomic Binary Sequences of Order Four and Six

Authors

  • Vladimir Edemskiy
  • Olga Antonova

Keywords:

Stream ciphers, sequences, generalized cyclotomy, linear complexity, minimal polynomial

Abstract

We propose a new computation method for the linear complexity and the minimal polynomial of Ding-Helleseth-generalized cyclotomic sequences. We will nd the linear complexity of Ding-Helleseth-generalized cyclotomic sequences of order four and six and make the results of Tongjiang Yan et al about the sequences of order four more specic.

Downloads

Published

2014-08-01

Issue

Section

Computer Science

How to Cite

On the Linear Complexity of Ding-Helleseth Generalized Cyclotomic Binary Sequences of Order Four and Six. (2014). European Journal of Pure and Applied Mathematics, 7(3), 256-266. https://ejpam.com/index.php/ejpam/article/view/1965

Similar Articles

1-10 of 363

You may also start an advanced similarity search for this article.