About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
type: Item
instance of: scholarly article
title: About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
zbMATH Open document ID: 1241.11141
author: Vladimir Edemskiy
published in: Designs, Codes and Cryptography
publication date: 2011-11-22T00:00:00Z
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 11T22
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 5976099
zbMATH Keywords: linear complexity
zbMATH Keywords: generalized cyclotomic sequences
MaRDI profile type: Publication
full work available at URL: s10623-010-9474-9
OpenAlex ID: W2004425646
cites work: New generalized cyclotomy and its applications
cites work: Q3939864
cites work: Linear Complexity of Some Generalized Cyclotomic Sequences
cites work: ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES
cites work: Linear Complexity and Autocorrelation of Prime Cube Sequences
cites work: On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
cites work: Q4208589
cites work: New self-dual codes over GF(4) with the highest known minimum weights
cites work: Q4400352
cites work: On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
cites work: Linear complexity of ternary sequences formed on the basis of power residue classes
cites work: Several classes of binary sequences with three-level autocorrelation
DOI: 10.1007/S10623-010-9474-9
description: scientific article; zbMATH DE number 5976099