IEICE TRANSACTIONS on Fundamentals
Characteristic Polynomials of Binary Complementary Sequences
Summary :
Recently two interesting conjectures on the linear complexity of binary complementary sequences of length 2nN0 were given by Karkkainen and Leppanen when those sequences are considered as periodic sequences with period 2nN0, where those sequences are constructed by successive concatenations or successive interleavings from a pair of kernel complementary sequences of length N0. Their conjectures were derived from numerical examples and suggest that those sequences have very large linear complexities. In this paper we give the exact formula of characteristic polynomials for those complementary sequences and show that their conjectures are true.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E80-A No.1 pp.193-196
- Publication Date
- 1997/01/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Information Theory and Coding 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
Satoshi UEHARA, Kyoki IMAMURA, "Characteristic Polynomials of Binary Complementary Sequences" in IEICE TRANSACTIONS on Fundamentals,
vol. E80-A, no. 1, pp. 193-196, January 1997, doi: .
Abstract: Recently two interesting conjectures on the linear complexity of binary complementary sequences of length 2nN0 were given by Karkkainen and Leppanen when those sequences are considered as periodic sequences with period 2nN0, where those sequences are constructed by successive concatenations or successive interleavings from a pair of kernel complementary sequences of length N0. Their conjectures were derived from numerical examples and suggest that those sequences have very large linear complexities. In this paper we give the exact formula of characteristic polynomials for those complementary sequences and show that their conjectures are true.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e80-a_1_193/_p
Copy
@ARTICLE{e80-a_1_193,
author={Satoshi UEHARA, Kyoki IMAMURA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Characteristic Polynomials of Binary Complementary Sequences},
year={1997},
volume={E80-A},
number={1},
pages={193-196},
abstract={Recently two interesting conjectures on the linear complexity of binary complementary sequences of length 2nN0 were given by Karkkainen and Leppanen when those sequences are considered as periodic sequences with period 2nN0, where those sequences are constructed by successive concatenations or successive interleavings from a pair of kernel complementary sequences of length N0. Their conjectures were derived from numerical examples and suggest that those sequences have very large linear complexities. In this paper we give the exact formula of characteristic polynomials for those complementary sequences and show that their conjectures are true.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Characteristic Polynomials of Binary Complementary Sequences
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 193
EP - 196
AU - Satoshi UEHARA
AU - Kyoki IMAMURA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 1997
AB - Recently two interesting conjectures on the linear complexity of binary complementary sequences of length 2nN0 were given by Karkkainen and Leppanen when those sequences are considered as periodic sequences with period 2nN0, where those sequences are constructed by successive concatenations or successive interleavings from a pair of kernel complementary sequences of length N0. Their conjectures were derived from numerical examples and suggest that those sequences have very large linear complexities. In this paper we give the exact formula of characteristic polynomials for those complementary sequences and show that their conjectures are true.
ER -
English
