Presentation 1999/11/30
Some Results Related to the Linear Complexity of Sequences
Kyoki IMAMURA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The liner complexity (LC) of a sequence has been used as a convenient measure of the randomness of a sequence. In this report firstly we will survey recent works about the instability of the LC of a periodic sequence, e.g., an extream change (increase or decrease) by one-symbol substitution, insertion, or deletion. Secondly we will survey recent works about the two complexities, i.e., k-error LC (k-LC) and MOC (Maximum Order Complexity), both of which are very natural generalization of the LC and useful for reducing the instability of the LC.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Periodic sequences over finite fields / linear complexity / instability of the linear complexity / k-error linear complexity / maximum order complexity
Paper # IT99-56
Date of Issue

Conference Information
Committee IT
Conference Date 1999/11/30(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 Information Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Some Results Related to the Linear Complexity of Sequences
Sub Title (in English)
Keyword(1) Periodic sequences over finite fields
Keyword(2) linear complexity
Keyword(3) instability of the linear complexity
Keyword(4) k-error linear complexity
Keyword(5) maximum order complexity
1st Author's Name Kyoki IMAMURA
1st Author's Affiliation Dept. of Computer Science and Electronics, Fac. of Computer Science and System Engineering, Kyushu Institute of Technology()
Date 1999/11/30
Paper # IT99-56
Volume (vol) vol.99
Number (no) 482
Page pp.pp.-
#Pages 9
Date of Issue