Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property release_kjxnmw4jbzh2th5jvytrsz57ei

by Phil Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter

Published in Lecture Notes in Computer Science by Springer Berlin Heidelberg.

1998   p43-54

Archived Files and Locations

application/pdf  357.8 kB
file_6uul67o6xrdaljcaw2zydyxd2q
repository.ust.hk (web)
web.archive.org (webarchive)
application/pdf  204.3 kB
file_s45zv4jgznavbiz4n46jrlczyu
web.archive.org (webarchive)
pdfs.semanticscholar.org (aggregator)
Read Archived PDF
Preserved and Accessible
Type  chapter
Stage   published
Year   1998
Container Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L:  0302-9743
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 5f53fb5b-0971-4af1-af42-5ce034d4b4ce
API URL: JSON