Error Linear Complexity Measures of Binary Multisequences

View Sample PDF

Author(s): M. Sindhu (Amrita Vishwa Vidyapeetham, India), S. Kumar Sajan (Amrita Vishwa Vidyapeetham, India)and M. Sethumadhavan (Amrita Vishwa Vidyapeetham, India)
Copyright: 2011
Pages: 10
Source title: Cyber Security, Cyber Crime and Cyber Forensics: Applications and Perspectives
Source Author(s)/Editor(s): Raghu Santanam (Arizona State University, USA), M. Sethumadhavan (Amrita University, India)and Mohit Virendra (Brocade Communications Systems, USA)
DOI: 10.4018/978-1-60960-123-2.ch017

Keywords: Digital Crime & Forensics / Information Science Reference / IT Security and Ethics / Security & Forensics

Purchase

View Error Linear Complexity Measures of Binary Multisequences on the publisher's website for pricing and purchasing information.

Abstract

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.

The IRMA Community

Research IRM

Error Linear Complexity Measures of Binary Multisequences

Purchase

Abstract

Related Content

IRMA Sponsors