Karthik Visweswariah, Sanjeev Kulkarni, et al.
IEEE International Symposium on Information Theory - Proceedings
It has recently become feasible to compute information rates of finite-state source/channel models with not too many states. In this paper, we apply such methods to finite-state approximations of channels that are not finite-state. In this way, an upper bound and a conjectured lower bound on the information rate of the actual channel can be computed.
Karthik Visweswariah, Sanjeev Kulkarni, et al.
IEEE International Symposium on Information Theory - Proceedings
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics