Enumeration results on the joint linear complexity of multisequences
type: Item
instance of: scholarly article
title: Enumeration results on the joint linear complexity of multisequences
zbMATH Open document ID: 1156.94328
author: L.-P. Wang
author: Harald Niederreiter
published in: Finite Fields and their Applications
publication date: 2009-02-09T00:00:00Z
Mathematics Subject Classification ID: 94A55
Mathematics Subject Classification ID: 11T71
zbMATH DE Number: 5503970
zbMATH Keywords: Multisequence shift-register synthesis
zbMATH Keywords: Lattice basis reduction algorithm
zbMATH Keywords: Joint linear complexity
MaRDI profile type: Publication
full work available at URL: j.ffa.2005.03.005
OpenAlex ID: W1975602219
cites work: Q4432454
cites work: Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm
cites work: Q2707427
cites work: Q3843987
cites work: The Probabilistic Theory of Linear Complexity
cites work: A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences
cites work: Q4036869
cites work: Progress in Cryptology - INDOCRYPT 2003
cites work: Rational points on curves over finite fields. Theory and Applications
cites work: Analysis and design of stream ciphers
cites work: Construction and estimation of bases in function fields
cites work: \(F[x]\)-lattice basis reduction algorithm and multisequence synthesis
cites work: On the Lattice Basis Reduction Multisequence Synthesis Algorithm
DOI: 10.1016/J.FFA.2005.03.005
description: scientific article; zbMATH DE number 5503970