Joint linear complexity of multisequences consisting of linear recurring sequences
type: Item
instance of: scholarly article
title: Joint linear complexity of multisequences consisting of linear recurring sequences
zbMATH Open document ID: 1178.94176
author: Fangwei Fu
author: Harald Niederreiter
author: Ferruh Özbudak
published in: Cryptography and Communications
publication date: 2009-10-26T00:00:00Z
Mathematics Subject Classification ID: 94A55
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 5620530
zbMATH Keywords: joint linear complexity
zbMATH Keywords: multisequences
zbMATH Keywords: linear recurring sequences
zbMATH Keywords: counting function
zbMATH Keywords: generating polynomial
MaRDI profile type: Publication
full work available at URL: s12095-007-0001-4
OpenAlex ID: W2015993444
cites work: Q4208589
cites work: Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences
cites work: Q4432454
cites work: The stability theory of stream ciphers
cites work: Q4832278
cites work: Counting functions and expected values for the lattice profile at \(n\)
cites work: Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
cites work: Q4453508
cites work: A generalized Euclidean algorithm for multisequence shift-register synthesis
cites work: A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
cites work: Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences
cites work: Multi-sequences with \(d\)-perfect property
cites work: On the counting function of the lattice profile of periodic sequences
cites work: The expectation and variance of the joint linear complexity of random periodic multisequences
cites work: The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity
cites work: Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm
cites work: Q2707427
cites work: On multisequence shift register synthesis and generalized-minimum- distance decoding of Reed-Solomon codes
cites work: Q3509721
cites work: Q4940707
cites work: Linear Complexity of Periodic Sequences: A General Theory
cites work: How many bits have to be changed to decrease the linear complexity?
cites work: Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences
cites work: On the Stability of&lt;tex&gt;$2^n$&lt;/tex&gt;-Periodic Binary Sequences
cites work: Counting functions and expected values for the \(k\)-error linear complexity
cites work: Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
cites work: On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
cites work: The expected value of the joint linear complexity of periodic multisequences
cites work: Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
cites work: Error linear complexity measures for multisequences
cites work: On the joint linear complexity profile of explicit inversive multisequences
cites work: Q4330647
cites work: Progress in Cryptology - INDOCRYPT 2003
cites work: The Probabilistic Theory of the Joint Linear Complexity of Multisequences
cites work: Q4330638
cites work: Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences
cites work: The asymptotic behavior of the joint linear complexity profile of multisequences
cites work: Lattice structure and linear complexity of nonlinear pseudorandom numbers
cites work: Analysis and design of stream ciphers
cites work: Q4011776
cites work: Extension of the Berlekamp-Massey algorithm to N dimensions
cites work: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
cites work: Enumeration results on the joint linear complexity of multisequences
cites work: Multisequences with almost perfect linear complexity profile and function fields over finite fields
DOI: 10.1007/S12095-007-0001-4
description: scientific article; zbMATH DE number 5620530