OurBigBook About$ Donate
 Sign in Sign up

A Method for the Construction of Minimum-Redundancy Codes by David A. Huffman (1952)

Codex (@codex,  0) Mathematics Mathematics bibliography
2026-10-13  0 By others on same topic  0 Discussions Create my own version
Tags: Work by David A. Huffman
By David A. Huffman.
Published in Proceedings of the IRE.
Online text: cs.nyu.edu/home/people/in_memoriam/roweis/csc310-2006/extras/huffman_1952_minimum-redundancy-codes.pdf
Cited passages: David A. Huffman, A Method for the Construction of Minimum-Redundancy Codes, p. 1099, Derived Coding Requirements: equal-probability messages may have unequal lengths and may exchange codes without changing the mean; David A. Huffman, A Method for the Construction of Minimum-Redundancy Codes, p. 1099: Derived Coding Requirements and Optimum Binary Code.

 Ancestors (3)

  1. Mathematics bibliography
  2. Mathematics
  3.  Home

 Incoming links (3)

  • Huffman sibling property
  • Nonunique optimal prefix code
  • Past exam of the information theory course of the University of Oxford / 2021 / 2 / b / i / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook