Representation of multichannel signature analyzers by linear polynomials over finite fields
type: Item
instance of: scholarly article
title: Representation of multichannel signature analyzers by linear polynomials over finite fields
zbMATH Open document ID: 0928.94001
DOI: 10.1007/BF02667197
author: A. S. Barashko
published in: Cybernetics and Systems Analysis
publication date: 1999-04-28T00:00:00Z
review text: The author gives a matrix criterion for the representability of multichannel signature analyzers of MISR (multiple input signature register) type by linear polynomials over extensions of the field GF(2), thus correcting a statement of \textit{P. K. Pradhan}, \textit{S. K. Gupta} and \textit{M. G. Karpovsky} [IEEE Trans. Comput. C-39, No. 4, 586-591 (1990)]. He also investigates this possibility for a more general case of linear sequential machines.
reviewed by: Indulis Strazdins
Mathematics Subject Classification ID: 94A05
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 11T06
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 1262962
zbMATH Keywords: multiple input signature
zbMATH Keywords: matrix criterion
zbMATH Keywords: representability of multichannel signature analyzers
zbMATH Keywords: linear polynomials
MaRDI profile type: Publication
cites work: Q3688305
cites work: On the theory of signature analyzers
cites work: Q5521558
cites work: CYCLE TYPES OF LINEAR SUBSTITUTIONS OVER FINITE COMMUTATIVE RINGS
full work available at URL: https://doi.org/10.1007/bf02667197
OpenAlex ID: W2047979938
description: scientific article; zbMATH DE number 1262962