On the linear complexity of binary lattices (Q386502): 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: 11K45 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6236781 / rank
 
Normal rank
Property / zbMATH Keywords
 
linear complexity
Property / zbMATH Keywords: linear complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
linear recursion
Property / zbMATH Keywords: linear recursion / rank
 
Normal rank
Property / zbMATH Keywords
 
two dimensions
Property / zbMATH Keywords: two dimensions / rank
 
Normal rank
Property / zbMATH Keywords
 
binary lattice
Property / zbMATH Keywords: binary lattice / rank
 
Normal rank
Property / zbMATH Keywords
 
pseudorandomness
Property / zbMATH Keywords: pseudorandomness / rank
 
Normal rank

Revision as of 14:00, 29 June 2023

scientific article
Language Label Description Also known as
English
On the linear complexity of binary lattices
scientific article

    Statements

    On the linear complexity of binary lattices (English)
    0 references
    0 references
    0 references
    0 references
    9 December 2013
    0 references
    0 references
    linear complexity
    0 references
    linear recursion
    0 references
    two dimensions
    0 references
    binary lattice
    0 references
    pseudorandomness
    0 references