On the linear complexity of generalized cyclotomic sequences with the period \(p^m\) (Q2469712): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Shift-register synthesis and BCH decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4208589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/ / rank
 
Normal rank
Property / cites work
 
Property / cites work: New generalized cyclotomy and its applications / rank
 
Normal rank

Latest revision as of 16:30, 27 June 2024

scientific article
Language Label Description Also known as
English
On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
scientific article

    Statements

    On the linear complexity of generalized cyclotomic sequences with the period \(p^m\) (English)
    0 references
    0 references
    0 references
    0 references
    7 February 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    stream ciphers
    0 references
    sequences
    0 references
    cyclotomy
    0 references
    linear complexity
    0 references
    minimal polynomials
    0 references
    0 references