Accession Number:

AD0711377

Title:

OPTIMAL VARIABLE LENGTH CODES (ARBITRARY SYMBOL COST AND EQUAL CODE WORD PROBABILITY),

Descriptive Note:

Corporate Author:

AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OHIO SCHOOL OF SYSTEMS AND LOGISTICS

Personal Author(s):

Report Date:

1970-06-23

Pagination or Media Count:

22.0

Abstract:

The problem of constructing minimum-redundancy prefix codes for the general discrete noiseless channel without constraints is solved for unequal code letter costs, provided that the symbols encoded are assumed to be equally probable. A graphical technique is developed for solving the problem for which the code words are equally probable and are constructed from r symbols where r is greater than or equal to two. A method is given for constructing an optional exhaustive prefix code. This method is then generalized to the extent that the exhaustive constraint is deleted, thereby resulting in an algorithm, designated ACE for arbitrary symbol cost and equal code word probability, which solves the stated problem. Author

Subject Categories:

  • Cybernetics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE