The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation
type: Item
instance of: scholarly article
title: The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation
zbMATH Open document ID: 1350.94026
author: A. Palvinskiy
author: Vladimir Edemskiy
published in: Information Processing Letters
publication date: 2015-12-01T00:00:00Z
Mathematics Subject Classification ID: 94A55
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
zbMATH DE Number: 6515015
zbMATH Keywords: cryptography
zbMATH Keywords: linear complexity
zbMATH Keywords: binary sequences
MaRDI profile type: Publication
full work available at URL: j.ipl.2015.09.007
OpenAlex ID: W1796785622
cites work: On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
cites work: New families of binary sequences with optimal three-level autocorrelation
cites work: On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
cites work: Q5713307
cites work: Q3939864
cites work: Q3216750
cites work: Linear Complexity of Periodic Sequences: A General Theory
cites work: The linear complexity of a class of binary sequences with period \(2p\)
DOI: 10.1016/J.IPL.2015.09.007
description: scientific article; zbMATH DE number 6515015