On Uniquely Decipherable Codes with Given Compositions,

reportActive / Technical Report | Accession Number: ADA035356 | Open PDF

Abstract:

It has been conjectured that a uniquely decipherable U.D. code can be replaced by a prefix code with the same codeword compositions. The conjecture is proved for the two length case, that is for U.D. codes with codeword lengths from the set l sub 1, l sub 2. This result is then extended to a more general class of U.D. codes and an equivalent conjecture is proposed for the general case. Author

Author(s):
Ntafos, S. C. ; Hakimi, S. L.
Author Organization(s):
NORTHWESTERN UNIV EVANSTON ILL DEPT OF ELECTRICAL ENGINEERING
Pagination:
0011

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
AFOSR-TR-77-0026
Contract/Grant Number(s):
AF-AFOSR-3017-76
Task Number(s):
A6
Project Number(s):
2304
Monitor Series:
TR-77-0026
 Subject Terms
Joint Capability Areas:
JCA_5_Command and Control; JCA_1.2_Force Preparation; JCA_1_Force Support; JCA_5.3_Planning
Modernization Areas:
Fully Networked C3
Communities of Interest:
Materials and Manufacturing Processes
Descriptor(s):
*CODING, *COMMUNICATION AND RADIO SYSTEMS, MATHEMATICAL ANALYSIS
Field(s)/Group(s):
Non-Radio Communications
Keyword(s):
*Variable length codes, WUAFOSR2304A6, PE61102F
Report Date:
1976 Jan 01