Minimum Delay Codes

DOI10.1137/0218006zbMATH Open0674.68036OpenAlexW1986473479MaRDI QIDQ3829074FDOQ3829074

Authors: Lawrence L. Larmore 

Publication date: 1989

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0218006

Recommendations

• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Optimum extensions of prefix codes.
• Three space-economical algorithms for calculating minimum-redundancy prefix codes
• Bounding the depth of search trees
• Source Coding for Quasiarithmetic Penalties

zbMATH Keywords

dynamic programmingconvex hullbinary treecoding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Coding theorems (Shannon theory) (94A24) Data structures (68P05)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Minimum Delay Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829074)