Order estimation for a special class of hidden Markov sources and binary renewal processes

IEEE Transactions on Information Theory

Volumn 48, Issue 6, 2002, Pages 1704-1713

  Khudanpur, Sanjeev ^a,b   Narayan, Prakash ^a,c  

^a IEEE   (United States)

^b Johns Hopkins University   (United States)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

Error exponent; Hidden Markov sources; Order estimation; Renewal processes; Renewal types

Indexed keywords

ORDER ESTIMATION; RENEWAL PROCESSES;

ERROR ANALYSIS; ESTIMATION; PROBABILITY; SET THEORY; THEOREM PROVING;

MARKOV PROCESSES;

EID: 0036611569     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.1003850     Document Type: Article

References (21)

1. Large deviations, tests and estimates
2. The minimum description length principle in coding and modeling
3. Variable length Markov chains
4. Consistency of the BIC Markov order estimator
5. Redundancy rates for renewal and other processes
6. Estimation of the order of a finite Markov chain
7. The optimal error exponent for Markov order estimation
8. Asymptotic formulae in combinatorial analysis
9. Maximum likelihood estimation for hidden Markov models
10. Order estimation and sequential universal data compression of a hidden Markov source by the method of mixtures
11. The estimation of model order in exponential families
12. On the estimation of the order of a Markov chain and universal data compression
13. Teletraffic engineering in a broadband era
14. Estimating the number of states of a finite state source