Prefix Codes: Equiprobable Words, Unequal Letter Costs

Details Prefix Codes: Equiprobable Words, Unequal Letter Costs Prefix Codes: Equiprobable Words, Unequal Letter Costs

2002-05-18

arxiv.org/abs/cs/0205049v1

SIAM J. Computing 25(6):1281-1304 (1996)

Computer Science

Data Structures and Algorithms

proceedings version in ICALP (1994)

Scientific paper

Describes a near-linear-time algorithm for a variant of Huffman coding, in
which the letters may have non-uniform lengths (as in Morse code), but with the
restriction that each word to be encoded has equal probability. [See also
``Huffman Coding with Unequal Letter Costs'' (2002).]

Affiliated with

Also associated with

No associations

Rating

Prefix Codes: Equiprobable Words, Unequal Letter Costs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Prefix Codes: Equiprobable Words, Unequal Letter Costs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Prefix Codes: Equiprobable Words, Unequal Letter Costs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-599195