Separating and Completely Separating Systems and Linear Codes

Author

Bose, Bella ; Rao, T.R.N.

Author_Institution

Department of Computer Science, Oregon State University

Issue

7

fYear

1980

fDate

7/1/1980 12:00:00 AM

Firstpage

665

Lastpage

668

Abstract

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.

Keywords

Asynchronous circuit; completely separating system; critical race; linear code; ordered pair; separating system; unicode single transition time assignment; unordered pair; Asynchronous circuits; Binary codes; Cascading style sheets; Clocks; Computer science; Linear code; Pulse circuits; Sequential circuits; Sufficient conditions; Vectors; Asynchronous circuit; completely separating system; critical race; linear code; ordered pair; separating system; unicode single transition time assignment; unordered pair;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/TC.1980.1675640

Filename

1675640