Optimal search trees and length restricted codes
From MaRDI portal
Publication:3867198
DOI10.1007/BF01931268zbMath0429.68062MaRDI QIDQ3867198
No author found.
Publication date: 1979
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01931268
68Q25: Analysis of algorithms and problem complexity
94A45: Prefix, length-variable, comma-free codes
68R99: Discrete mathematics in relation to computer science
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Optimum binary search trees
- Optimal search trees and length restricted codes
- Aspects of compact programs and directly executed languages
- A Study of the Physical Structure of Algorithms
- Optimal Binary Search Trees with Restricted Maximal Depth
- Optimal variable length codes (arbitrary symbol cost and equal code word probability)