Accession Number:

ADA050974

Title:

Generalization of Huffman Coding to Minimize the Probability of Buffer Overflow,

Descriptive Note:

Corporate Author:

MASSACHUSETTS INST OF TECH CAMBRIDGE ELECTRONIC SYSTEMS LAB

Personal Author(s):

Report Date:

1978-02-01

Pagination or Media Count:

12.0

Abstract:

An algorithm is given to find a prefix condition code that minimizes the value of the moment generating function of its codeword length distribution for a given positive argument. This algorithm is used in an iterative way to yield a code that maximizes the rate of decay of the probability of buffer length increases. Author

Subject Categories:

  • Computer Programming and Software
  • Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE