This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Separating and Completely Separating Systems and Linear Codes
July 1980 (vol. 29 no. 7)
pp. 665-668
B. Bose, Department of Computer Science, Oregon State University
In this correspondence, we present some more properties of separating systems (SS) and completely separating systems (CSS) from coding theory framework. First we derive the necessary and sufficient conditions for a set of vectors to be a SS or CSS. Then we show that in the case of linear codes, the necessary and sufficient conditions required for (1, 1) CSS are similar to that of (2, 1) SS and by deleting the 0 vector from a binary code that forms a (2, 1) SS, the set of remaining code words forms a (1, 1) CSS. Even though some linear codes form (2, 1) and (2, 2) SS, we prove here that no linear code forms a(2, 1) or a(2, 2) CSS.
Index Terms:
unordered pair, Asynchronous circuit, completely separating system, critical race, linear code, ordered pair, separating system, unicode single transition time assignment
Citation:
B. Bose, T.R.N. Rao, "Separating and Completely Separating Systems and Linear Codes," IEEE Transactions on Computers, vol. 29, no. 7, pp. 665-668, July 1980, doi:10.1109/TC.1980.1675640
Usage of this product signifies your acceptance of the Terms of Use.