On the Linear Complexity of Generalized Cyclotomic Binary Sequences with Length 2p2
Summary :
In this paper, we compare two generalized cyclotomic binary sequences with length 2p2 in terms of the linear complexity. One classical sequence is defined using the method introduced by Ding and Helleseth, while the other modified sequence is defined in a slightly different manner. We show that the modified sequence has linear complexity of 2p2, which is higher than that of the classical one.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.1 pp.302-308
- Publication Date
- 2010/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E93.A.302
- Type of Manuscript
- PAPER
- Category
- Cryptography and Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jingwei ZHANG, Chang-An ZHAO, Xiao MA, "On the Linear Complexity of Generalized Cyclotomic Binary Sequences with Length 2p2" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 1, pp. 302-308, January 2010, doi: 10.1587/transfun.E93.A.302.
Abstract: In this paper, we compare two generalized cyclotomic binary sequences with length 2p2 in terms of the linear complexity. One classical sequence is defined using the method introduced by Ding and Helleseth, while the other modified sequence is defined in a slightly different manner. We show that the modified sequence has linear complexity of 2p2, which is higher than that of the classical one.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.302/_p
Copy
@ARTICLE{e93-a_1_302,
author={Jingwei ZHANG, Chang-An ZHAO, Xiao MA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Linear Complexity of Generalized Cyclotomic Binary Sequences with Length 2p2},
year={2010},
volume={E93-A},
number={1},
pages={302-308},
abstract={In this paper, we compare two generalized cyclotomic binary sequences with length 2p2 in terms of the linear complexity. One classical sequence is defined using the method introduced by Ding and Helleseth, while the other modified sequence is defined in a slightly different manner. We show that the modified sequence has linear complexity of 2p2, which is higher than that of the classical one.},
keywords={},
doi={10.1587/transfun.E93.A.302},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - On the Linear Complexity of Generalized Cyclotomic Binary Sequences with Length 2p2
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 302
EP - 308
AU - Jingwei ZHANG
AU - Chang-An ZHAO
AU - Xiao MA
PY - 2010
DO - 10.1587/transfun.E93.A.302
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2010
AB - In this paper, we compare two generalized cyclotomic binary sequences with length 2p2 in terms of the linear complexity. One classical sequence is defined using the method introduced by Ding and Helleseth, while the other modified sequence is defined in a slightly different manner. We show that the modified sequence has linear complexity of 2p2, which is higher than that of the classical one.
ER -
English
