✦ LIBER ✦

Optimal search trees and length restricted codes

✍ Scribed by Å. Wikström

Book ID: 105402487
Publisher: Springer Netherlands
Year: 1979
Tongue: English
Weight: 428 KB
Volume: 19
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01931268

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal Binary Search Trees with Restric

Optimal Binary Search Trees with Restricted Maximal Depth

✍ Garey, M. R. 📂 Article 📅 1974 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 762 KB

Optimal alphabetic search trees with res

Optimal alphabetic search trees with restricted maximal height

✍ Russell L. Wessner 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 678 KB

Optimal Search in Trees

✍ Ben-Asher, Yosi; Farchi, Eitan; Newman, Ilan 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 342 KB

Computationally Optimal Metric-First Cod

Computationally Optimal Metric-First Code Tree Search Algorithms

✍ Mohan, S.; Anderson, J. 📂 Article 📅 1984 🏛 IEEE 🌐 English ⚖ 779 KB

Optimal Parsing Trees for Run-Length Cod

Optimal Parsing Trees for Run-Length Coding of Biased Data

✍ Aviran, S.; Siegel, P.H.; Wolf, J.K. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 418 KB

Optimal binary covering codes of length

Optimal binary covering codes of length 2j

✍ William D. Weakley 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

## Abstract The minimum size of a binary covering code of length __n__ and covering radius __r__ is denoted by __K__(__n__,__r__), and codes of this length are called optimal. For __j__ > 0 and __n__ = 2^__j__^, it is known that __K__(__n__,1) = 2 · __K__(__n__−1,1) = 2^__n − j__^. Say that two bin