Generating dynamic huffman codes
US7609182B2 · kind B2 · utility
10Cited by
0References
6Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | May 21, 2008 |
| Grant date | Oct 27, 2009 |
| Priority date | — |
| Expiry date | May 21, 2028 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M7/40
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.