Reduced-complexity filtering for partially observed nearly completely decomposable Markov chains

Subhrakanti Dey. Reduced-complexity filtering for partially observed nearly completely decomposable Markov chains. IEEE Transactions on Signal Processing, 48(12):3334-3344, 2000. [doi]

@article{Dey00,
  title = {Reduced-complexity filtering for partially observed nearly completely decomposable Markov chains},
  author = {Subhrakanti Dey},
  year = {2000},
  doi = {10.1109/78.886997},
  url = {http://dx.doi.org/10.1109/78.886997},
  researchr = {https://researchr.org/publication/Dey00},
  cites = {0},
  citedby = {0},
  journal = {IEEE Transactions on Signal Processing},
  volume = {48},
  number = {12},
  pages = {3334-3344},
}