Complexity analysis of binary nonlinear feedforward sequences through minimum polynomials of compound matrices
type: Item
instance of: scholarly article
title: Complexity analysis of binary nonlinear feedforward sequences through minimum polynomials of compound matrices
zbMATH Open document ID: 0581.94022
DOI: 10.1016/0012-365X(85)90027-5
author: Meena Kumari
published in: Discrete Mathematics
publication date: 1985-01-01T00:00:00Z
review text: The problem of finding the complexity of the nonlinear feedforward sequences has been analysed and a unified method has been developed for finding the complexity of such sequences for the cases when feedback is (i) an irreducible polynomial; (ii) product of two irreducible polynomials; (iii) power of an irreducible polynomial. The method is based on the minimum polynomial of the compound matrix formed from the companion matrix of the feedback polynomial. Apart from being a unified method, this approach has the advantage that it can be applied to any level of logic and one can get the minimal generator of all possible nonlinear feedforward sequences.
Mathematics Subject Classification ID: 94B99
zbMATH DE Number: 3930898
zbMATH Keywords: irreducible polynomial
zbMATH Keywords: feedback polynomial
MaRDI profile type: Publication
cites work: Q5737099
cites work: Q5684568
cites work: Generation of binary sequences with controllable complexity
cites work: An analysis of the structure and complexity of nonlinear binary sequence generators
cites work: Q4754499
cites work: Q5331504
cites work: Shift-register synthesis and BCH decoding
cites work: Q3290963
cites work: Inequalities of compound and induces matrices with applications to combinatorial analysis
cites work: Q5816704
cites work: Q4758117
cites work: Linear Recurring Sequences
full work available at URL: 0012-365x(85)90027-5
OpenAlex ID: W2068884891
description: scientific article; zbMATH DE number 3930898