The Asymptotic Normalized Linear Complexity of Multisequences

Simple item page
dc.creatorVielhaber, Michael
dc.creatorCanales, Monica del Pilar
dc.date2007-05-29
dc.date.accessioned2026-07-07T08:16:07Z
dc.date.available2026-07-07T08:16:07Z
dc.descriptionWe show that the asymptotic linear complexity of a multisequence a in F_q^\infty that is I := liminf L_a(n)/n and S := limsup L_a(n)/n satisfy the inequalities M/(M+1) <= S <= 1 and M(1-S) <= I <= 1-S/M, if all M sequences have nonzero discrepancy infinitely often, and all pairs (I,S) satisfying these conditions are met by 2^{\aleph_0} multisequences a. This answers an Open Problem by Dai, Imamura, and Yang. Keywords: Linear complexity, multisequence, Battery Discharge Model, isometry.
dc.description19 pages, 2 figures, submitted to J. Complexity
dc.identifierhttps://arxiv.org/abs/0705.4138
dc.identifierhttp://arxiv.org/abs/0705.4138
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133670
dc.subjectInformation Theory
dc.subjectComputational Complexity
dc.subjectCryptography and Security
dc.titleThe Asymptotic Normalized Linear Complexity of Multisequences
dc.typetext

Files

Collections

arXiv