Optimal prefix-free codes for unequal letter costs: Dynamic programming with 
the Monge property

Bradford, Phillip Gnassi; Golin, Mordecai J.; Larmore, Lawrence L.

Local TagsRelease HistoryDetailsSummary

Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property

Bradford, P. G., Golin, M. J., & Larmore, L. L. (2002). Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property. Journal of Algorithms, 42, 277-303.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3023-4 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3024-2

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Bradford, Phillip Gnassi¹, Author
Golin, Mordecai J.¹, Author
Larmore, Lawrence L., Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2003-08-20Date issued: 2002

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 202058
Other: Local-ID: C1256428004B93B8-C1C8FFA6B7DC0159C1256D21002D612C-BradfordGolinLarmore2002

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Journal of Algorithms

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 42 Sequence Number: - Start / End Page: 277 - 303 Identifier: ISSN: 0196-6774