Characteristic Polynomials of Binary Complementary Sequences
スポンサーリンク
概要
- 論文の詳細を見る
Recently two interesting conjectures on the linear complexity of binary complementary sequences of length 2^nN_0 were given by Karkkainen and Leppanen when those sequences are considered as periodic sequences with period 2^nN_0, where those sequences are constructed by successive concatenations or successive interleavings from a pair of kernel complementary sequences of length N_0. 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.
- 社団法人電子情報通信学会の論文
- 1997-01-25
著者
-
Uehara Satoshi
Dept. Of Information And Media Sciences The University Of Kitakyushu
-
Uehara Satoshi
Faculty Of Computer Science And Systems Engineering Kyushu Institute Of Technology
-
Imamura Kyoki
Faculty Of Computer Science And Systems Engineering Kyushu Institute Of Technology
-
Uehara S
Dept. Of Information And Media Sciences The University Of Kitakyushu
関連論文
- Zero Correlation Distribution of ZCZ Sequences Obtained from a Perfect Sequence and a Unitary Matrix
- Correlation Distribution of a Set of Quaternary Sequences Modified from the Binary Gold Sequences
- On Characteristic Polynomials for Sequences with Maximum Period over Z_
- Linear Complexities of Periodic Sequences Obtained from Sequences over Z_4 and Z_8 by One-Symbol Substitution
- Maximum Order Complexity for the Minimum Changes of an M-Sequence
- Characteristic Polynomials of Binary Complementary Sequences
- Balanced Binary Sequences with Optimal Periodic Correlation Properties
- Linear Complexity of Periodic Sequences Obtained from a Sequence over GF(p) with Period p^n-1 by One-Symbol Deletion
- Some Properties of Logistic Maps over Integers
- On p-Ary Bent Sequences
- Approximate Odd Periodic Correlation Distributions of Binary Sequences (Special Issue on Spread Spectrum Techniques and Applications)
- Value Distribution of Linear Complexity for p-Ary Periodic Sequences with Period p^n, p a Prime
- Some Properties of Partial Autocorrelation of Binary M-Sequences (Special Section on Information Theory and Its Applications)
- Rounding Logistic Maps over Integers and the Properties of the Generated Sequences