The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1973 vol.22)
pp: 891-896
R.S. Kashef , Department of Electrical Engineering, University of Southern California
ABSTRACT
Critical races can be avoided in the binary encoding of asynchronous sequential machines by making use of general codes employing-multistep changes in secondary variables to accomplish transitions between states. The shortest length code of this type presently available is Huffman's internmeshed row set code, which encodes race-free any 2<sup>S</sup>O-row flow table with 2S<inf>o</inf>-1 bits. In
INDEX TERMS
Asynchronous sequential machines, augmented parity check codes, general race-free codes, maximum distance partition.
CITATION
R.S. Kashef, R.B. McGhee, "Augmented Parity Check Codes for Encoding of Asynchronous Sequential Machines", IEEE Transactions on Computers, vol.22, no. 10, pp. 891-896, October 1973, doi:10.1109/T-C.1973.223614
40 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool