A counterexample concerning the 3-error linear complexity of \(2^{n }\)-periodic binary sequences
type: Item
instance of: scholarly article
title: A counterexample concerning the 3-error linear complexity of \(2^{n }\)-periodic binary sequences
zbMATH Open document ID: 1243.94023
published in: Designs, Codes and Cryptography
publication date: 2012-07-31T00:00:00Z
Mathematics Subject Classification ID: 94A55
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11B50
zbMATH DE Number: 6062564
zbMATH Keywords: periodic sequence
zbMATH Keywords: linear complexity
zbMATH Keywords: \(k\)-error linear complexity
author: Jianqin Zhou
MaRDI profile type: Publication
full work available at URL: s10623-011-9576-z
OpenAlex ID: W1979651630
cites work: Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity
Wikidata QID: Q124812679
DOI: 10.1007/S10623-011-9576-Z
description: scientific article; zbMATH DE number 6062564