|
31
|
Shitz), “On information rates for mismatched decoders
– N Merhav, G Kaplan, A Lapidoth, S Shamai
- 1994
|
|
12
|
Channel capacity for a given decoding metric
– I Csiszár, P Narayan
- 1995
|
|
8
|
Mismatched decoding and the multiple-access channel
– A Lapidoth
- 1996
|
|
617
|
Information Theory; Coding Theorems for Discrete Memoryless Systems
– I Csiszar, J Körner
- 1981
|
|
6
|
Fundamental issues of multiple accessing
– J Y N Hui
- 1983
|
|
13
|
Nonprobabilistic mutual information without memory, Probl
– V D Goppa
- 1975
|
|
82
|
Reliable Communication Under Channel Uncertainty
– Amos Lapidoth, Prakash Narayan, Senior Member
- 1998
|
|
14
|
The compound channel capacity of a class of finite-state channels ,” Information Theory
– A Lapidoth, I E Telatar
- 1998
|
|
22
|
Nearest neighbor decoding for additive non-Gaussian noise channels ,” Information Theory
– A Lapidoth
- 1996
|
|
1106
|
Information Theory and Reliable Communication
– R G Gallager
- 1968
|
|
6
|
Coding theorem for discrete memoryless channels with given decision rules
– V B Balakirsky
- 1991
|
|
12
|
Arbitrarily varying channels with general alphabets and states
– I Csiszár
- 1992
|
|
59
|
Coding Theorems of Information Theory
– J Wolfowitz
- 1961
|
|
23
|
A.J.: The capacities of certain channel classes under random coding
– D Blackwell, L Breiman, Thomasian
- 1960
|
|
238
|
Rate Distortion Theory: A mathematical basis for data compression. Englewood Cliffs (New
– T Berger
- 1971
|
|
25
|
Universal decoding for channels with memory
– M Feder, A Lapidoth
- 1998
|
|
244
|
Comments on Broadcast Channels
– Thomas M. Cover
- 1998
|
|
127
|
A general formula for channel capacity
– S Verdú, T S Han
- 1994
|
|
109
|
On channel capacity per unit cost
– S Verdu
- 1990
|
