Асосий контентга ўтиш
AkademIndex

Маҳсулотлар

Ишлаб чиқувчилар учун

AkademBaseЭкотизим учун очиқ API
Мақола

Entropy and data compression schemes

Donald OrnsteinDept. of Math., Stanford Univ., CA, USABernard WeissInstitute of Mathematics, Hebrew University, Jerusalem, Israel
1993en
ABI

Аннотация

Some new ways of defining the entropy of a process by observing a single typical output sequence as well as a new kind of Shannon-McMillan-Breiman theorem are presented. This provides a new and conceptually very simple ways of estimating the entropy of an ergodic stationary source as well as new insight into the workings of such well-known data compression schemes as the Lempel-Ziv algorithm.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Ҳали таржима қилинмаган

Идентификаторлар

Иқтибослар ва манбалар

2 та иқтибос0 та фойдаланилган манба