Minimizing Excess Code Length and VLSI Complexity in the Multiplication Free Approximation of Arithmetic Coding.
Gennady Feygin|P. Glenn Gulak|Paul Chow
| Anthology ID: | DBLP:journals/ipm/FeyginGC94 |
|---|---|
| Year: | 1994 |
| Venue: | Information Processing and Management |
| Pages: | 805-816 |
| URL: | https://doi.org/10.1016/0306-4573(94)90008-6 |
| DOI: | https://doi.org/10.1016/0306-4573(94)90008-6 |
| DBLP: | journals/ipm/FeyginGC94 |
| BibTeX: |
@article{feygin-1994-minimizing,
author = {Gennady Feygin and
P. Glenn Gulak and
Paul Chow},
title = {{Minimizing Excess Code Length and VLSI Complexity in the Multiplication Free Approximation of Arithmetic Coding}},
journal = {Information Processing and Management},
volume = {30},
number = {6},
pages = {805--816},
year = {1994},
url = {https://doi.org/10.1016/0306-4573(94)90008-6},
doi = {https://doi.org/10.1016/0306-4573(94)90008-6}
}