✦ LIBER ✦

Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm

✍ Scribed by Plotnik, E.; Weinberger, M.J.; Ziv, J.

Book ID: 114539502
Publisher: IEEE
Year: 1992
Tongue: English
Weight: 548 KB
Volume: 38
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.108250

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the redundancy of the fixed-database

On the redundancy of the fixed-database Lempel-Ziv algorithm for φ-mixing sources

✍ En-hui Yang; Kieffer, J.C. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 626 KB

On the Nonlinear Complexity and Lempel–Z

On the Nonlinear Complexity and Lempel–Ziv Complexity of Finite Length Sequences

✍ Limniotis, K.; Kolokotronis, N.; Kalouptsidis, N. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 435 KB

An estimate of the upper bound on error

An estimate of the upper bound on error probability for maximum-likelihood sequence estimation on channels having a finite-duration pulse response (Corresp.)

✍ Magee, F.; Proakis, J. 📂 Article 📅 1973 🏛 IEEE 🌐 English ⚖ 615 KB

On computing upper and lower bounds on t

On computing upper and lower bounds on the outputs of linear elasticity problems approximated by the smoothed finite element method

✍ Z. C. Xuan; T. Lassila; G. Rozza; A. Quarteroni 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB 👁 1 views

## Abstract Verification of the computation of local quantities of interest, e.g. the displacements at a point, the stresses in a local area and the stress intensity factors at crack tips, plays an important role in improving the structural design for safety. In this paper, the smoothed finite elem

Tight bound on the length of distinguish

Tight bound on the length of distinguishing sequences for non-observable nondeterministic Finite-State Machines with a polynomial number of inputs and outputs

✍ Iksoon Hwang; Nina Yevtushenko; Ana Cavalli 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 126 KB