ON THE UNIQUE DECODABILITY OF CODES.

reportActive / Technical Report | Accession Number: AD0633022 | Need Help?

Abstract:

A simplication 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. Author

Author(s):
Lipson, John D.
Author Organization(s):
CRUFT LAB HARVARD UNIV CAMBRIDGE MASS
Descriptive Note:
Interim technical rept.,
Pagination:
0011

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
TR-498
Contract/Grant Number(s):
Nonr-1866(16)
Project Number(s):
NR-372-012
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*DECODING, *CODING, SEQUENCES(MATHEMATICS), INFORMATION THEORY, ALGORITHMS
Field(s)/Group(s):
Cybernetics
Report Date:
1966 Apr 01