| Upper (2008) | |||||||||||||||
Abstract | |||||||||||||||
| It has recently become feasible to compute information rates of finite-state source/channel models with not too many states. Such methods can also be used to compute upper and lower bounds on the information rate of very general (non-finite-state) channels with memory by means of finite-state approximations. We review these methods and present new reduced-state bounds. | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||