Characteristic polynomials of binary complementary sequences

被引：0

作者：

Uehara, S

Imamura, K

机构：

来源：

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 1997年 / E80A卷 / 01期

关键词：

binary complementary sequences; concatenation; interleaving; characteristic polynomial; linear complexity;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Recently two interesting conjectures on the linear complexity of binary complementary sequences of length 2(n) N-0 were given by Karkkainen and Leppanen when those sequences are considered as periodic sequences with period 2(n) N-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.

引用

页码：193 / 196

页数：4