Welcome to the InfoSci Platform
Error Linear Complexity Measures of Binary Multisequences

Error Linear Complexity Measures of Binary Multisequences

M. Sindhu, S. Kumar Sajan, M. Sethumadhavan
Copyright: © 2011 |Pages: 10
ISBN13: 9781609601232|ISBN10: 1609601238|EISBN13: 9781609601256
DOI: 10.4018/978-1-60960-123-2.ch017
Cite Chapter Cite Chapter

MLA

Sindhu, M., et al. "Error Linear Complexity Measures of Binary Multisequences." Cyber Security, Cyber Crime and Cyber Forensics: Applications and Perspectives, edited by Raghu Santanam, et al., IGI Global, 2011, pp. 240-249. https://doi.org/10.4018/978-1-60960-123-2.ch017

APA

Sindhu, M., Sajan, S. K., & Sethumadhavan, M. (2011). Error Linear Complexity Measures of Binary Multisequences. In R. Santanam, M. Sethumadhavan, & M. Virendra (Eds.), Cyber Security, Cyber Crime and Cyber Forensics: Applications and Perspectives (pp. 240-249). IGI Global. https://doi.org/10.4018/978-1-60960-123-2.ch017

Chicago

Sindhu, M., S. Kumar Sajan, and M. Sethumadhavan. "Error Linear Complexity Measures of Binary Multisequences." In Cyber Security, Cyber Crime and Cyber Forensics: Applications and Perspectives, edited by Raghu Santanam, M. Sethumadhavan, and Mohit Virendra, 240-249. Hershey, PA: IGI Global, 2011. https://doi.org/10.4018/978-1-60960-123-2.ch017

Export Reference

Mendeley
Favorite

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.