Optimal search trees and length restricted codes

DOI10.1007/BF01931268MaRDI QIDQ3867198zbMATH OpenOpenAlexFDO

Authors

Publication date 1979

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01931268

zbMATH Keywords

algorithmdirectly executed languagesoptimal search treesprefix codesvariable-length codes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Prefix, length-variable, comma-free codes (94A45)

Cites work

• A Study of the Physical Structure of Algorithms
• Aspects of compact programs and directly executed languages
• scientific article; zbMATH DE number 3571501 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Optimal Binary Search Trees with Restricted Maximal Depth
• Optimal search trees and length restricted codes
• Optimal variable length codes (arbitrary symbol cost and equal code word probability)
• Optimum binary search trees

Cited in

(1)

• Optimal search trees and length restricted codes

This page was built for publication: Optimal search trees and length restricted codes

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