On uniquely decipherable codes with given compositions
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.
- Publication:
-
NASA STI/Recon Technical Report N
- Pub Date:
- 1976
- Bibcode:
- 1976STIN...7725397N
- Keywords:
-
- Coding;
- Radio Signals;
- Telecommunication;
- Codes;
- Numerical Analysis;
- Signal Encoding;
- Variability;
- Communications and Radar