The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity

The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Saved in:
Bibliographic Details
Main Authors: Fu, F.-W., Niederreiter, H., Su, M.
Other Authors: TEMASEK LABORATORIES
Format: Conference or Workshop Item
Published: 2014
Subjects:
Counting function
Fast algorithms
k-Error linear complexity
Linear complexity
Periodic sequences
Stream cipher systems
Online Access:http://scholarbank.nus.edu.sg/handle/10635/111649
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore

Internet

http://scholarbank.nus.edu.sg/handle/10635/111649

Similar Items