Year: 2002
Type: conference-paper
Abstract: It has recently become feasible to compute information rates of finite-state source/channel models with not too many states. We review such methods and demonstrate their extension to compute upper and lower bounds on the information rate of very general (non-finite-state) channels by means of finite-state approximations.
Authors: Dieter Arnold, Hans-andrea Loeliger, Pascal O. Vontobel
Institution: ETH Zurich
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2131342300
