The linear complexity deviation of multisequences: formulae for finite lengths and asymptotic distributions

DOI10.1007/978-3-642-30615-0_16zbMATH Open1290.94035OpenAlexW106218068MaRDI QIDQ2907288FDOQ2907288

Authors: Michael Vielhaber, Mónica del Pilar Canales Chacón 

Publication date: 7 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30615-0_16

Recommendations

• Error linear complexity measures for multisequences
• Improved results on the probabilistic theory of the joint linear complexity of multisequences
• Joint linear complexity of multisequences consisting of linear recurring sequences
• The asymptotic behavior of the joint linear complexity profile of multisequences
• The Probabilistic Theory of the Joint Linear Complexity of Multisequences

zbMATH Keywords

linear complexitymultisequencebattery discharge model

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Cited In (3)

• The expectation and variance of the joint linear complexity of random periodic multisequences
• The Hausdorff Dimension of the Set of r-Perfect M-Multisequences
• Classification and counting on multi-continued fractions and its application to multi-sequences

This page was built for publication: The linear complexity deviation of multisequences: formulae for finite lengths and asymptotic distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907288)