Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity
type: Item
instance of: scholarly article
title: Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity
zbMATH Open document ID: 1174.94010
author: Ramakanth Kavuluru
published in: Designs, Codes and Cryptography
publication date: 2009-11-04T00:00:00Z
Mathematics Subject Classification ID: 94A55
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 5625013
MaRDI profile type: Publication
full work available at URL: s10623-009-9295-x
OpenAlex ID: W2055170485
cites work: Q4208589
cites work: The stability theory of stream ciphers
cites work: The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity
cites work: A fast algorithm for determining the complexity of a binary sequence with period&lt;tex&gt;2^n&lt;/tex&gt;(Corresp.)
cites work: 2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k = 2 or 3
cites work: A relationship between linear complexity and k-error linear complexity
cites work: Shift-register synthesis and BCH decoding
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: Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequences
cites work: Analysis and design of stream ciphers
cites work: An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
DOI: 10.1007/S10623-009-9295-X
description: scientific article; zbMATH DE number 5625013