SIGN IN
SIGN UP
Algorithm 673: Dynamic Huffman coding
Full Text:
PDF
Buy this Article
see
source materials
below for
more options
Author:
Jeffrey Scott Vitter
Department of Computer Science, Brown University, Providence, R.I.
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 15 Issue 2, June 1989
Pages 158-167
ACM
New York, NY
, USA
table of contents
doi>
10.1145/63522.214390
1989 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 24
· Downloads (cumulative): 1,206
· Citation Count: 8
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
data communications
data compaction and compression
design
huffman codes
nonsecret encoding schemes
performance
theory
trees
value of information
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder