An algorithm for k-error joint linear complexity of binary multi-sequences

Our aim is to find some of the analogues of results related to k-error linear complexity of single sequences to the case of multisequences over GF (2). This paper presents algorithms for finding the joint linear complexity and the k-error joint linear complexity of m-fold binary multisequences of pe...

Full description

Saved in:
Bibliographic Details
Published inJournal of discrete mathematical sciences & cryptography Vol. 11; no. 3; pp. 297 - 304
Main Authors Sethumadhavan, M, Sindhu, M, Srinivasan, Chungath, Kavitha, C
Format Journal Article
LanguageEnglish
Published 01.06.2008
Online AccessGet full text

Cover

More Information
Summary:Our aim is to find some of the analogues of results related to k-error linear complexity of single sequences to the case of multisequences over GF (2). This paper presents algorithms for finding the joint linear complexity and the k-error joint linear complexity of m-fold binary multisequences of period 2n.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0972-0529
DOI:10.1080/09720529.2008.10698185