Linear complexity of generalized cyclotomic binary sequences of length 2pm
J Zhang, CA Zhao, X Ma - Applicable Algebra in Engineering …, 2010 - Springer
J Zhang, CA Zhao, X Ma
Applicable Algebra in Engineering, Communication and Computing, 2010•SpringerIn this paper, binary sequences based on the generalized cyclotomy are studied. We define
two generalized cyclotomic sequences of length 2 pm, one sequence (called the classical
one) is defined using the classical method, the other one (called the modified one) is defined
in a slightly modified manner. The linear complexity of the two proposed sequences of
length 2 pm is determined with two different approaches. The results show that the two
proposed sequences have high linear complexity.
two generalized cyclotomic sequences of length 2 pm, one sequence (called the classical
one) is defined using the classical method, the other one (called the modified one) is defined
in a slightly modified manner. The linear complexity of the two proposed sequences of
length 2 pm is determined with two different approaches. The results show that the two
proposed sequences have high linear complexity.
Abstract
In this paper, binary sequences based on the generalized cyclotomy are studied. We define two generalized cyclotomic sequences of length 2p m , one sequence (called the classical one) is defined using the classical method, the other one (called the modified one) is defined in a slightly modified manner. The linear complexity of the two proposed sequences of length 2p m is determined with two different approaches. The results show that the two proposed sequences have high linear complexity.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果