The linear complexity of generalized cyclotomic sequences with period \(2p^n\)
type: Item
instance of: scholarly article
title: The linear complexity of generalized cyclotomic sequences with period \(2p^n\)
zbMATH Open document ID: 1384.11031
author: Olga Antonova
author: Vladimir Edemskiy
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 2014-09-18T00:00:00Z
Mathematics Subject Classification ID: 11B50
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 94A55
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6345824
zbMATH Keywords: binary sequences
zbMATH Keywords: generalized cyclotomy
zbMATH Keywords: linear complexity
MaRDI profile type: Publication
full work available at URL: s00200-014-0223-6
OpenAlex ID: W1214756888
cites work: Q4208589
cites work: Q4400352
cites work: New generalized cyclotomy and its applications
cites work: Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/
cites work: Cyclotomy and duadic codes of prime lengths
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: About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
cites work: Q5713307
cites work: Q3939864
cites work: On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\)
cites work: Q3216750
cites work: Q4718481
cites work: Remarks on the generalized cyclotomic sequences of length \(2p^m\)
cites work: On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
cites work: Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
DOI: 10.1007/S00200-014-0223-6
description: scientific article; zbMATH DE number 6345824