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

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1978
Accession Number
ADA050974

Entities

People

  • Pierre A. Humblet

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Alphabets
  • Coding
  • Computer Programming
  • Computer Science
  • Electrical Engineering
  • Engineering
  • Information Systems
  • Information Theory
  • Massachusetts
  • Military Research
  • Plastic Explosives
  • Probability
  • Probability Distributions
  • Symbols

Fields of Study

  • Computer science

Readers

  • Computer Programming and Software Development.
  • Mathematical Modeling and Probability Theory.