The Probabilistic Theory of the Joint Linear Complexity of Multisequences

2006 ◽  
pp. 5-16 ◽  
Author(s):  
Harald Niederreiter
Keyword(s):  
Linear Complexity ◽  
Probabilistic Theory ◽  
Joint Linear Complexity

An algorithm fork-error joint linear complexity of binary multisequences

2008 ◽  
Vol 11 (3) ◽  
pp. 297-304 ◽  
Author(s):  
M. Sethumadhavan ◽  
M. Sindhu ◽  
Chungath Srinivasan ◽  
C. Kavitha
Keyword(s):  
Linear Complexity ◽  
Joint Linear Complexity

Error Linear Complexity Measures of Binary Multisequences

2011 ◽  
pp. 240-249
Author(s):  
M. Sindhu ◽  
S. Kumar Sajan ◽  
M. Sethumadhavan
Keyword(s):  
Linear Complexity ◽  
Complexity Measures ◽  
Minimum Number ◽  
Joint Linear Complexity ◽  
Error Linear Complexity

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.

Sign in / Sign up

Export Citation Format

Share Document