✦ LIBER ✦

Optimal binary prefix-condition codes with ordinal probabilities

✍ Scribed by Greenberg, Irwin

Publisher: John Wiley and Sons
Year: 1990
Tongue: English
Weight: 432 KB
Volume: 41
Category: Article
ISSN: 0002-8231
DOI: 10.1002/(sici)1097-4571(199007)41:5<330::aid-asi3>3.0.co;2-h

No coin nor oath required. For personal study only.

✦ Synopsis

Probability estimates for letters in a finite alphabet are derived in order to apply the Huffman algorithm to determine an optimal binary prefix-condition code. The estimates maximize the entropy subject to constraints specifying second-level orderings of the letters' iikeiihoods. These are compared to estimates obtained from another probability estimation technique described in the decision theory literature using the English aiphabet as an example.

📜 SIMILAR VOLUMES

Optimal Prefix-Free Codes for Unequal Le

Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property

✍ Phil Bradford; Mordecai J. Golin; Lawrence L. Larmore; Wojciech Rytter 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 293 KB

In this paper we discuss the problem of finding optimal prefix-free codes for unequal letter costs, a variation of the classical Huffman coding problem. Our problem consists of finding a minimal cost prefix-free code in which the encoding alphabet consists of unequal cost (length) letters, with leng

Optimal sequence estimation for convolut

Optimal sequence estimation for convolutionally coded signals with binary digital modulation in ISI channels

✍ Fuqin Xiong 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 752 KB

Decoding convolutional codes with binary digital modulation in intersymbol inter-Jerence (ISI) channels is studied. The receiver structure is a whitened matched filter (WMF) whose transi[br function is determined by the ISI channel. Decoding t~f the output sequence can be per/brined in two steps or

On the dynamical equations of conditiona

On the dynamical equations of conditional probability density functions, with applications to optimal stochastic control theory

✍ Harold J Kushner 📂 Article 📅 1964 🏛 Elsevier Science 🌐 English ⚖ 640 KB

Binary neurons with analog communication

Binary neurons with analog communication links for solving large-scale optimization problems: Yoon-Pin Simon Foo, Yoshiyasu Takefuji. Department of Electrical and Computer Engineering, University of South Carolina, Columbia, SC 29208 USA, and Harold Szu, Naval Research Laboratory, Code 5756, Washington, DC 20375-5000 USA

📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 109 KB