DocumentCode :
948044
Title :
Tests for unique decipherability
Author :
Even, Shimon
Volume :
9
Issue :
2
fYear :
1963
fDate :
4/1/1963 12:00:00 AM
Firstpage :
109
Lastpage :
112
Abstract :
A test for unique decipherability of a given codeword set is described. The test also shows whether the set is decipherable with a finite delay, and in the latter case, determines the necessary delay. Finally, it is shown how the test of Sardinas and Patterson [1] can be used to get the same result, 
as was conjectured by Gilbert and Moore [2].
as was conjectured by Gilbert and Moore [2].Keywords :
Coding; Decoding; Automata; Automatic testing; Delay; Length measurement;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1963.1057817
Filename :
1057817
Link To Document :
