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
ASCII Text
x 
 
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.
 
 
BibTex
x
 
@article{ 10.1109/TC.1980.1675640,
author = {B. Bose and T.R.N. Rao},
title = {Separating and Completely Separating Systems and Linear Codes},
journal ={IEEE Transactions on Computers},
volume = {29},
number = {7},
issn = {0018-9340},
year = {1980},
pages = {665-668},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1980.1675640},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Separating and Completely Separating Systems and Linear Codes
IS - 7
SN - 0018-9340
SP665
EP668
EPD - 665-668
A1 - B. Bose,
A1 - T.R.N. Rao,
PY - 1980
KW - unordered pair
KW - Asynchronous circuit
KW - completely separating system
KW - critical race
KW - linear code
KW - ordered pair
KW - separating system
KW - unicode single transition time assignment
VL - 29
JA - IEEE Transactions on Computers
ER -
 
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.