Generating dynamic huffman codes

Coded data generation or conversion – Digital code to digital code converters – To or from number of pulses

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C341S050000, C341S051000

Reexamination Certificate

active

07609182

ABSTRACT:
Huffman trees may be rapidly and effectively created by sorting a plurality of nodes by weight in an insertion sorter stack, popping the two lowest weighted nodes from the insertion sorter stack, forming a branch node from the popped entries, and placing the branch node into the insertion sorter.

REFERENCES:
patent: 2007/0168560 (2007-07-01), Alkire

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Generating dynamic huffman codes does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Generating dynamic huffman codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generating dynamic huffman codes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4127401

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.