DocumentCode :
908790
Title :
On the unique decodability of codes (Corresp.)
Author :
Lipson, J.
Volume :
13
Issue :
2
fYear :
1967
fDate :
4/1/1967 12:00:00 AM
Firstpage :
339
Lastpage :
340
Abstract :
A simplification of the Sardinas and Patterson test for unique decodability is given. It is shown that duplicate sequences of code symbols generated by that algorithm can be omitted, resulting in a more efficient algorithm with respect to computer storage and time required to carry out the test. This simplicity is employed in deriving an improved upper bound on the number of sequences of code symbols that must be generated in order to determine whether or not a given code is uniquely decodable. This easily computed bound serves as a measure of the amount of computer storage and time required to carry out the test for any given code.
Keywords :
Decoding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1967.1053981
Filename :
1053981
Link To Document :
بازگشت