S. Uehara et K. Imamura, CHARACTERISTIC-POLYNOMIALS OF BINARY COMPLEMENTARY SEQUENCES, IEICE transactions on fundamentals of electronics, communications and computer science, E80A(1), 1997, pp. 193-196
Citations number
4
Categorie Soggetti
Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture","Computer Science Information Systems
Recently two interesting conjectures on the linear complexity of binar
y 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 succes
sive 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 lar
ge linear complexities. In this paper we give the exact formula of cha
racteristic polynomials for those complementary sequences and show tha
t their conjectures are true.