pith. sign in

arxiv: cs/0608018 · v1 · submitted 2006-08-03 · 💻 cs.IT · math.IT

The single-serving channel capacity

classification 💻 cs.IT math.IT
keywords channelepsilonanswerbitscapacityerrorfollowinggiven
0
0 comments X
read the original abstract

In this paper we provide the answer to the following question: Given a noisy channel and epsilon>0, how many bits can be transmitted with an error of at most epsilon by a single use of the channel?

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.