Petrides, George and Mykkeltveit, Johannes (2006) How to Check for Short Cycles in Large Nonlinear Feedback Shift Registers. [MIMS Preprint]
![[thumbnail of nonlin3.pdf]](https://eprints.maths.manchester.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
nonlin3.pdf Restricted to Registered users only Download (211kB) |
Abstract
In \cite{Ly} it is claimed that for a given large nonlinear feedback shift register it is hard to check whether short cycles have been embedded by the given method. The purpose of the present note is to show how to check for short cycles in general using our proposed algorithm. To implement the algorithm we introduce the notion of nonlinear complexity and try to classify sequences into nonlinear complexity classes.
| Item Type: | MIMS Preprint |
|---|---|
| Uncontrolled Keywords: | Nonlinear feedback shift register, short cycles, nonlinear complexity. |
| Subjects: | MSC 2010, the AMS's Mathematics Subject Classification > 40 Sequences, series, summability MSC 2010, the AMS's Mathematics Subject Classification > 68 Computer science |
| Depositing User: | Mr George Petrides |
| Date Deposited: | 08 Mar 2006 |
| Last Modified: | 08 Nov 2017 18:18 |
| URI: | https://eprints.maths.manchester.ac.uk/id/eprint/173 |
Actions (login required)
 |
View Item |