A note on the minimal representation of triggering matrices
Author:
Arthur Gill
Journal:
Quart. Appl. Math. 19 (1961), 69-71
MSC:
Primary 94.00
DOI:
https://doi.org/10.1090/qam/120081
MathSciNet review:
120081
Full-text PDF Free Access
Abstract |
References |
Similar Articles |
Additional Information
Abstract: A triggering matrix is an array of numbers in which each row represents an actuating input of a data-processing system. In this note, upper and lower bounds are given to the minimal form of such a matrix.
- Arthur Gill, Pattern recognition, J. Res. Nat. Bur. Standards Sect. D 64D (1960), 676–677. MR 0134376
M. Plotkin, Binary codes with specified minimum distance, Research Div. Rept. 51-20, The University of Pennsylvania Moore School of Electrical Engineering, Philadelphia, Pa., 1951
- D. D. Joshi, A note on upper bounds for minimum distance codes, Information and Control 1 (1958), 289–295. MR 99264
A. Gill, Minimal-scan pattern recognition, IRE Trans, on Information Theory, IT-5, 52–58 (1959)
M. Plotkin, Binary codes with specified minimum distance, Research Div. Rept. 51-20, The University of Pennsylvania Moore School of Electrical Engineering, Philadelphia, Pa., 1951
D. D. Joshi, A note on upper bounds for minimum distance codes, Information and Control 1, 289–295 (1958)
Similar Articles
Retrieve articles in Quarterly of Applied Mathematics
with MSC:
94.00
Retrieve articles in all journals
with MSC:
94.00
Additional Information
Article copyright:
© Copyright 1961
American Mathematical Society
