Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. LCS Publications
  4. LCS Technical Memos (1974 - 2003)
  5. Minimax Optimal Universal Codeword Sets

Minimax Optimal Universal Codeword Sets

Thumbnail Image
Download
Name

MIT-LCS-TM-212.pdf

Size

4.69 MB

Format

Adobe PDF

Checksum (MD5)

f06464e01dcc7c311eb2adffeceb20be

Author(s)
Elias, Peter
Date Issued
January 1982
Series/Report no.
MIT-LCS-TM-212
Abstract
In an interactive multi-user data-processing system a user knows the probabilities of his messages and must encode them into a fixed system-wide variable-length codeword set. He needs to receive the answer to his last message before selecting the next, so his encoding is one-shot. To minimize average codeword length he encodes his messages in order of decreasing probability into codewords in order of increasing length. I give an algorithm which, for each of several measures of performance, finds the codeword set best by that measure for the worst user, and some of the minimax optimal codeword sets the algorithm has found. Some of the results hold for all user distributions: others require e.g. that all users send exactly or at most m distinct messages, and/or that there is an integer k such that no user has a message of probability greater than 1/k.
Persistent DSpace Link
https://hdl.handle.net/1721.1/149023
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.