Back close

Error Linear Complexity Measures of Binary Multisequences

Publication Type : Journal Article

Thematic Areas : TIFAC-CORE in Cyber Security

Source : 2011

Campus : Coimbatore

School : School of Engineering, Centre for Cybersecurity Systems and Networks

Center : TIFAC CORE in Cyber Security

Department : Computer Science, cyber Security, Mathematics

Year : 2011

Abstract : The joint linear complexity and k-error joint linear complexity of an m-fold 2nnbsp;periodic multisequence can be efficiently computed using Modified Games Chan algorithmnbsp;and Extended Stamp Martin Algorithm respectively. In this chapter the authors derive annbsp;algorithm which, given a constant c and an m–fold 2n periodic binary multisequence S,nbsp;computes the minimum number k of errors and the associated error multisequence needednbsp;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.2supv/sup periodic binary multisequence.

Cite this Research Publication : Dr. Sindhu M. and Dr. M. Sethumadhavan, “Error Linear Complexity Measures of Binary Multisequences”, 2011.

Admissions Apply Now