Representation of multichannel signature analyzers by linear polynomials over finite fields (Q1280895)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Representation of multichannel signature analyzers by linear polynomials over finite fields |
scientific article; zbMATH DE number 1262962
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Representation of multichannel signature analyzers by linear polynomials over finite fields |
scientific article; zbMATH DE number 1262962 |
Statements
Representation of multichannel signature analyzers by linear polynomials over finite fields (English)
0 references
28 April 1999
0 references
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.
0 references
multiple input signature
0 references
matrix criterion
0 references
representability of multichannel signature analyzers
0 references
linear polynomials
0 references
