Linear Complexity and Related Complexity Measures for Sequences

Author(s):  
Harald Niederreiter
Author(s):  
M. Sindhu ◽  
S. Kumar Sajan ◽  
M. Sethumadhavan

The joint linear complexity and k - error joint linear complexity of an m - fold 2n periodic multisequence can be efficiently computed using Modified Games Chan algorithm and Extended Stamp Martin Algorithm respectively. In this chapter the authors derive an algorithm which, given a constant c and an m – fold 2n periodic binary multisequence S, computes the minimum number k of errors and the associated error multisequence needed over a period of S for bringing the joint linear complexity of S below c . They derived another algorithm for finding the joint linear complexity of 3. 2v periodic binary multisequence.


2013 ◽  
Vol 62 (16) ◽  
pp. 6-10
Author(s):  
Sindhu. M ◽  
M. Sethumadhavan

2007 ◽  
Vol 118 (9) ◽  
pp. 2009-2015 ◽  
Author(s):  
Karl-Jürgen Bär ◽  
Michael Karl Boettger ◽  
Mandy Koschke ◽  
Steffen Schulz ◽  
Pratap Chokka ◽  
...  

2007 ◽  
Vol 23 (2) ◽  
pp. 169-192 ◽  
Author(s):  
Wilfried Meidl ◽  
Harald Niederreiter ◽  
Ayineedi Venkateswarlu

2010 ◽  
Vol 24 (2) ◽  
pp. 131-135 ◽  
Author(s):  
Włodzimierz Klonowski ◽  
Pawel Stepien ◽  
Robert Stepien

Over 20 years ago, Watt and Hameroff (1987 ) suggested that consciousness may be described as a manifestation of deterministic chaos in the brain/mind. To analyze EEG-signal complexity, we used Higuchi’s fractal dimension in time domain and symbolic analysis methods. Our results of analysis of EEG-signals under anesthesia, during physiological sleep, and during epileptic seizures lead to a conclusion similar to that of Watt and Hameroff: Brain activity, measured by complexity of the EEG-signal, diminishes (becomes less chaotic) when consciousness is being “switched off”. So, consciousness may be described as a manifestation of deterministic chaos in the brain/mind.


Sign in / Sign up

Export Citation Format

Share Document