Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences


Let S1, S2, . . . , St be t N -periodic sequences over Fq. The joint linear complexity L(S1, S2, . . . , St) is the least order of a linear recurrence relation that S1, S2, . . . , St satisfy simultaneously. Since the Fqlinear spaces Fq and Fqt are isomorphic, a multisequence can also be identified with a single sequence S having its terms in the extension… (More)
DOI: 10.1007/11423461_5


  • Presentations referencing similar topics