How to determine linear complexity and k-error linear complexity in some classes of linear recurring sequences
Work
Year: 2008
Type: article
Source: Cryptography and Communications
Author Wilfried Meidl
Institution Sabancı Üniversitesi
Cites: 22
Cited by: 3
Related to: 10
FWCI: 0.42
Citation percentile (by year/subfield): 67.22
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed