On Universal Single Transition Time Asynchronous State Assignments

Authors:
T. Nanya;Y. Tohma
Affiliations:
Central Research Laboratories, Nippon Electric Co., Ltd.;-
Venue:
IEEE Transactions on Computers
Year:
1978

Citing 2
Cited 1

Universal Single Transition Time Asynchronous State Assignments

IEEE Transactions on Computers
Techniques to Construct

IEEE Transactions on Computers

Partially Identifying Codes for Copyright Protection

AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Quantified Score

Hi-index	14.98

Visualization

Abstract

One of two constructive procedures for universal single transition time (STT) state assignments presented in the paper [1] by Friedman et al. is not correct. A correct constructive procedure can be obtained by simply modifying the procedure of the literature with an additional restriction.