Premium
On the linear complexity of generalized cyclotomic binary sequences of length 2 pq
Author(s) -
Chang ZuLing,
Li Dandan
Publication year - 2013
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.3052
Subject(s) - binary number , mathematics , class (philosophy) , combinatorics , discrete mathematics , algorithm , computer science , arithmetic , artificial intelligence
SUMMARY In this paper, a new class of generalized cyclotomic binary sequences with period of 2 pq is established. The linear complexity and minimal polynomials of proposed sequences of length 2 pq are determined. The results show that such sequences of length 2 pq have high linear complexity. Copyright © 2013 John Wiley & Sons, Ltd.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom