Fast Codes for Large Alphabets

Details Fast Codes for Large Alphabets Fast Codes for Large Alphabets

2005-04-03

arxiv.org/abs/cs/0504005v1

Computer Science

Information Theory

published

Scientific paper

We address the problem of constructing a fast lossless code in the case when the source alphabet is large. The main idea of the new scheme may be described as follows. We group letters with small probabilities in subsets (acting as super letters) and use time consuming coding for these subsets only, whereas letters in the subsets have the same code length and therefore can be coded fast. The described scheme can be applied to sources with known and unknown statistics.

Affiliated with

Also associated with

No associations

Rating

Fast Codes for Large Alphabets 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 Fast Codes for Large Alphabets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Codes for Large Alphabets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-302016