On the linear complexity of FCSR sequences
type: Item
instance of: scholarly article
title: On the linear complexity of FCSR sequences
zbMATH Open document ID: 1044.94011
author: Hong Xu
author: Wenfeng Qi
published in: Applied Mathematics. Series B (English Edition)
publication date: 2004-05-27T00:00:00Z
Mathematics Subject Classification ID: 94A55
Mathematics Subject Classification ID: 11B50
Mathematics Subject Classification ID: 11B39
zbMATH DE Number: 2068246
zbMATH Keywords: linear recurring sequence
zbMATH Keywords: feedback with carry shift register
zbMATH Keywords: linear complexity
MaRDI profile type: Publication
full work available at URL: s11766-003-0057-7
OpenAlex ID: W1989406345
cites work: 2-Adic shift registers
cites work: Q2757250
cites work: Feedback shift registers, 2-adic span, and combiners with memory
cites work: Fourier transforms and the 2-adic span of periodic binary sequences
cites work: Analysis and design of stream ciphers
cites work: A lower bound on the linear span of an FCSR
cites work: Q3216750
DOI: 10.1007/S11766-003-0057-7
description: scientific article; zbMATH DE number 2068246