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. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1976
Accession Number
ADA035356

Entities

People

  • S. C. Ntafos
  • S. L. Hakimi

Organizations

  • Northwestern University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Alphabets
  • Communication Systems
  • Computer Science
  • Decoding
  • Electrical Engineering
  • Engineering
  • Inequalities
  • Integer Programming
  • Personality
  • Random Variables
  • Scientific Research
  • Sequences
  • Trees (Data Structures)

Fields of Study

  • Mathematics

Readers

  • Computer Programming and Software Development.