Name
Abstract | ||
|---|---|---|
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers, and encode each symbol by using some suitable prefix coding for each layer. In this paper, we formulate the problem of finding an alphabet partitioning for the design of a two-layer semiadaptive code as an optimization problem, and give a solution based on dynamic program... |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/TCOMM.2006.888894 | IEEE Transactions on Communications |
Keywords | DocType | Volume |
Huffman coding,Dynamic programming,Entropy coding,Partitioning algorithms,Statistics,Design optimization,Heuristic algorithms,Greedy algorithms,Algorithm design and analysis,Code standards | Journal | 55 |
Issue | ISSN | Citations |
3 | 0090-6778 | 3 |
PageRank | References | Authors |
0.43 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dan Chen | 1 | 17 | 2.29 |
| Yi-jen Chiang | 2 | 503 | 38.21 |
| Nasir Memon | 3 | 3328 | 299.76 |
| Xiaolin Wu | 4 | 3672 | 286.80 |