You are here: MIMS > EPrints
MIMS EPrints

2006.25: How to Check for Short Cycles in Large Nonlinear Feedback Shift Registers

2006.25: George Petrides and Johannes Mykkeltveit (2006) How to Check for Short Cycles in Large Nonlinear Feedback Shift Registers.

Full text available as:

PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
207 Kb

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 2000 > 40 Sequences, series, summability
MSC 2000 > 68 Computer science
MIMS number:2006.25
Deposited By:Mr George Petrides
Deposited On:08 March 2006

Download Statistics: last 4 weeks
Repository Staff Only: edit this item