Presentation	2001/12/6 On Complexities for Sequences and Their Computing Algorithms Takayasu KAIDA,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	Pseudo-random sequences are important in the fields of communications and computer science. In this paper definitions of linear complexity(LC), maximum order complexity(MOC)and κ-error linear complexity(κ-LC), some properties of them for tipical sequences, and their computing algorithms are given. Especially, properties of LC for minimum-changed sequences from M-sequences and properties of κ-LC for peridic sequnces with zero sum property are shown.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	Sequence / periodic sequence / complexity / linear complexity / κ-error linear complexity / algorithm for complexity
Paper #	SST 2001-49
Date of Issue

Conference Information
Committee	SST
Conference Date	2001/12/6(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Spread Spectrum Technology (SST)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	On Complexities for Sequences and Their Computing Algorithms
Sub Title (in English)
Keyword(1)	Sequence
Keyword(2)	periodic sequence
Keyword(3)	complexity
Keyword(4)	linear complexity
Keyword(5)	κ-error linear complexity
Keyword(6)	algorithm for complexity
1st Author's Name	Takayasu KAIDA
1st Author's Affiliation	Dept.of Information and Electronic Engineering, Yatsushiro National College of Technology()
Date	2001/12/6
Paper #	SST 2001-49
Volume (vol)	vol.101
Number (no)	490
Page	pp.pp.-
#Pages	8
Date of Issue