Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\) (Q267793): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A55 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6567137 / rank
 
Normal rank
Property / zbMATH Keywords
 
cryptography
Property / zbMATH Keywords: cryptography / rank
 
Normal rank
Property / zbMATH Keywords
 
sequences
Property / zbMATH Keywords: sequences / rank
 
Normal rank
Property / zbMATH Keywords
 
linear complexity
Property / zbMATH Keywords: linear complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
minimal polynomial
Property / zbMATH Keywords: minimal polynomial / rank
 
Normal rank

Revision as of 15:51, 27 June 2023

scientific article
Language Label Description Also known as
English
Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
scientific article

    Statements

    Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\) (English)
    0 references
    0 references
    0 references
    0 references
    11 April 2016
    0 references
    0 references
    cryptography
    0 references
    sequences
    0 references
    linear complexity
    0 references
    minimal polynomial
    0 references