Fetching the paper…
Reading the bibliography…
This paper considers the derivative of the entropy rate of a hidden Markov process with respect to the observation probabilities.
On chains of infinite order
T. E. Harris · 1955
Earlier work this paper cites.
Entropy of functions of finite-state Markov chains
D. Blackwell · 1957
Earlier work this paper cites.
Proof of Shannon’s transmission theorem for finite-state indecomposable channels
D. Blackwell, L. Breiman, and A. J. Thomasian · 1958
Earlier work this paper cites.
Products of random matrices
H. Furstenberg and H. Kesten · 1960
Earlier work this paper cites.
Approximations for the entropy for functions of Markov chains
J. Birch · 1962
Earlier work this paper cites.
Statistical inference for probabilistic functions of finite state Markov chains
L. E. Baum and T. Petrie · 1966
Earlier work this paper cites.
Information Theory and Reliable Communication
R. G. Gallager · 1968
Earlier work this paper cites.
A multiplicative ergodic theorem. Lyapunov characteristic numbers for dynamical systems
V. I. Oseledec · 1968
Earlier work this paper cites.
Probabilistic functions of finite state Markov chains
T. Petrie · 1969
Earlier work this paper cites.
Continuous speech recognition by statistical methods
F. Jelinek · 1976
Earlier work this paper cites.
Analyticity properties of the characteristic exponents of random matrix products
D. Ruelle · 1979
Earlier work this paper cites.
Non-Negative Matrices: An Introduction to Theory and Applications
E. Seneta · 1981
Earlier work this paper cites.
Relative distance – an error measure in round-off error analysis
A. Ziv · 1982
Earlier work this paper cites.
Random matrix products and measures on projective spaces
H. Furstenberg and Y. Kifer · 1983
Earlier work this paper cites.
Capacity and coding for Gilbert-Elliot channels
M. Mushkin and I. Bar-David · 1989
Earlier work this paper cites.
Elements of Information Theory
T. M. Cover and J. A. Thomas · 1991
Cited alongside, same era.
Domains of analytic continuation for the top Lyapunov exponent
Y. Peres · 1992
Cited alongside, same era.
Hidden Markov models in computational biology: Applications to protein modeling
A. Krogh, M. Brown, I. Mian, K. Sjolander, and D. Haussler · 1994
Cited alongside, same era.
Capacity, mutual information, and coding for finite-state Markov channels
A. J. Goldsmith and P. P. Varaiya · 1996
Cited alongside, same era.
Introduction to Real Analysis
R. G. Bartle and D. R. Sherbert · 1999
Cited alongside, same era.
Convergence of probability measures
P. Billingsley · 1999
Cited alongside, same era.
Life above threshold: From list decoding to area theorem and MSE
C. Méasson, A. Montanari, T. J. Richardson, and R. L. Urbanke · 2004
Later among the works it cites.
New bounds on the entropy rate of hidden Markov processes
E. Ordentlich and T. Weissman · 2004
Later among the works it cites.
Approximations for the entropy rate of a hidden Markov process
E. Ordentlich and T. Weissman · 2005
Later among the works it cites.
The entropy of a binary hidden Markov process
O. Zuk, I. Kanter, and E. Domany · 2005
Later among the works it cites.
Simulation-based computation of information rates for channels with memory
D. Arnold, H. A. Loeliger, P. O. Vontobel, A. Kavčić, and W. Zeng · 2006
Later among the works it cites.
From finite-system entropy to entropy rate for a hidden Markov process
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Basic properties of the projective product with application to products of column-allowable nonnegative matrices
F. Le Gland and L. Mevel · 2000
Cited alongside, same era.
Exponential forgetting and geometric ergodicity in hidden Markov models
F. Le Gland and L. Mevel · 2000
Cited alongside, same era.
On the information rate of binary-input channels with memory
D. Arnold and H. Loeliger · 2001
Cited alongside, same era.
On the capacity of Markov sources over noisy channels
A. Kavčić · 2001
Cited alongside, same era.
On the achievable information rates of finite state ISI channels
H. D. Pfister, J. B. Soriaga, and P. H. Siegel · 2001
Cited alongside, same era.
Hidden Markov processes
Y. Ephraim and N. Merhav · 2002
Cited alongside, same era.
E. Domany, I. Kanter, O. Zuk, and M. Aizenman · 2006
Later among the works it cites.
Analyticity of entropy rate of hidden Markov chains
G. Han and B. Marcus · 2006
Later among the works it cites.
Capacity of finite state channels based on Lyapunov exponents of random matrices
T. Holliday, A. Goldsmith, and P. Glynn · 2006
Later among the works it cites.
On the optimality of symbol-by-symbol filtering and denoising
E. Ordentlich and T. Weissman · 2006
Later among the works it cites.
Asymptotics of noisy constrained channel capacity
G. Han and B. Marcus · 2007
Later among the works it cites.
Derivatives of entropy rate in special familes of hidden Markov chains
G. Han and B. Marcus · 2007
Later among the works it cites.
Markov processes asymptotically achieve the capacity of finite-state intersymbol interference channels
J. Chen and P. H. Siegel · 2008
Later among the works it cites.
Maxwell construction: The hidden bridge between iterative and maximum a posteriori decoding
C. Méasson, A. Montanari, and R. L. Urbanke · 2008
Later among the works it cites.
A generalization of the Blahut–Arimoto algorithm to finite-state channels
P. O. Vontobel, A. Kavčić, D. M. Arnold, and H. A. Loeliger · 2008
Later among the works it cites.