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
 
Set OpenAlex properties.
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Dong-Dai Lin / rank
Normal rank
 
Property / author
 
Property / author: Dong-Dai Lin / rank
 
Normal rank
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
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/s12095-015-0138-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W793948417 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 22:54, 19 March 2024

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
    0 references