Name
Abstract | ||
|---|---|---|
The problem of estimating the number of states of a finite-alphabet, finite-state source is investigated. An estimator is developed that asymptotically attains the minimum probability of understanding the number of states, among all estimators with a prescribed exponential decay rate of overestimation probability. The proposed estimator relies on the Lempel-Ziv data compression algorithm in an intuitively appealing manner |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1109/18.108249 | Information Theory, IEEE Transactions |
Keywords | Field | DocType |
data compression,information theory,probability,Lempel-Ziv data compression algorithm,exponential decay rate,finite alphabet source,finite-state source,minimum probability,number of states estimation,overestimation probability,underestimation probability | Information theory,Discrete mathematics,Combinatorics,Markov model,Minimax estimator,Exponential decay,State variable,Data compression,Mathematics,Consistent estimator,Estimator | Journal |
Volume | Issue | ISSN |
38 | 1 | 0018-9448 |
Citations | PageRank | References |
35 | 29.47 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Ziv | 1 | 6124 | 1414.57 |
| Merhav, N. | 2 | 35 | 29.47 |