Trace Representation of Binary Generalized Cyclotomic Sequences with Length pm
Summary :
Some new generalized cyclotomic sequences defined by C. Ding and T. Helleseth are proven to exhibit a number of good randomness properties. In this paper, we determine the defining pairs of these sequences of length pm (p prime, m ≥ 2) with order two, then from which we obtain their trace representation. Thus their linear complexity can be derived using Key's method.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E94-A No.2 pp.761-765
- Publication Date
- 2011/02/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E94.A.761
- Type of Manuscript
- PAPER
- Category
- Information Theory
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
Xiaoni DU, Zhixiong CHEN, "Trace Representation of Binary Generalized Cyclotomic Sequences with Length pm" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 2, pp. 761-765, February 2011, doi: 10.1587/transfun.E94.A.761.
Abstract: Some new generalized cyclotomic sequences defined by C. Ding and T. Helleseth are proven to exhibit a number of good randomness properties. In this paper, we determine the defining pairs of these sequences of length pm (p prime, m ≥ 2) with order two, then from which we obtain their trace representation. Thus their linear complexity can be derived using Key's method.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.761/_p
Copy
@ARTICLE{e94-a_2_761,
author={Xiaoni DU, Zhixiong CHEN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Trace Representation of Binary Generalized Cyclotomic Sequences with Length pm},
year={2011},
volume={E94-A},
number={2},
pages={761-765},
abstract={Some new generalized cyclotomic sequences defined by C. Ding and T. Helleseth are proven to exhibit a number of good randomness properties. In this paper, we determine the defining pairs of these sequences of length pm (p prime, m ≥ 2) with order two, then from which we obtain their trace representation. Thus their linear complexity can be derived using Key's method.},
keywords={},
doi={10.1587/transfun.E94.A.761},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - Trace Representation of Binary Generalized Cyclotomic Sequences with Length pm
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 761
EP - 765
AU - Xiaoni DU
AU - Zhixiong CHEN
PY - 2011
DO - 10.1587/transfun.E94.A.761
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2011
AB - Some new generalized cyclotomic sequences defined by C. Ding and T. Helleseth are proven to exhibit a number of good randomness properties. In this paper, we determine the defining pairs of these sequences of length pm (p prime, m ≥ 2) with order two, then from which we obtain their trace representation. Thus their linear complexity can be derived using Key's method.
ER -
English
