About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\) (Q648068): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-010-9474-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004425646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New generalized cyclotomy and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Complexity of Some Generalized Cyclotomic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Complexity and Autocorrelation of Prime Cube Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear complexity of generalized cyclotomic sequences with the period \(p^m\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4208589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New self-dual codes over GF(4) with the highest known minimum weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear complexity of ternary sequences formed on the basis of power residue classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Several classes of binary sequences with three-level autocorrelation / rank
 
Normal rank

Latest revision as of 16:44, 4 July 2024

scientific article
Language Label Description Also known as
English
About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
scientific article

    Statements

    About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\) (English)
    0 references
    0 references
    22 November 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    linear complexity
    0 references
    generalized cyclotomic sequences
    0 references
    0 references