55 citations · 79 across the 10 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
cs.IT2012★ 4 cited
A simpler derivation of the coding theorem
Yuval Lomnitz, Meir Feder
A simple proof for the Shannon coding theorem, using only the Markov inequality, is presented. The technique is useful for didactic purposes, since it does not require many prelimi…
cs.IT2012★ 7 cited
Communication over Individual Channels -- a general framework
Yuval Lomnitz, Meir Feder
We consider the problem of communicating over a channel for which no mathematical model is specified, and the achievable rates are determined as a function of the channel input and…
cs.IT2012★ 1 cited
Universal communication part II: channels with memory
Yuval Lomnitz, Meir Feder
Consider communication over a channel whose probabilistic model is completely unknown vector-wise and is not assumed to be stationary. Communication over such channels is challengi…