1998
DOI: 10.1109/18.720535
|View full text |Cite
|
Sign up to set email alerts
|

Reliable communication under channel uncertainty

Abstract: In many communication situations, the transmitter and the receiver must be designed without a complete knowledge of the probability law governing the channel over which transmission takes place. Various models for such channels and their corresponding capacities are surveyed. Special emphasis is placed on the encoders and decoders which enable reliable communication over these channels. Index Terms-Arbitrarily varying channel, compound channel, deterministic code, finite-state channel, Gaussian arbitrarily var… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

3
454
0

Year Published

2003
2003
2014
2014

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 460 publications
(457 citation statements)
references
References 108 publications
(228 reference statements)
3
454
0
Order By: Relevance
“…A less powerful model is that of the compound channel where the jammer has a choice of strategies, but the chosen channel law does not change during the transmission of various symbols of the codeword. AVCs have been the subject of much research -the reader can find a good introduction to this topic as well as numerous pointers to the extensive literature in a survey by Lapidoth and Narayan [54]. To the author's understanding, it seems that much of the work has been of a non-constructive flavor, driven by the information-theoretic motivation of determining the capacity under different AVC variants.…”
Section: Remark 1 [Arbitrarily Varying Channel]mentioning
confidence: 99%
“…A less powerful model is that of the compound channel where the jammer has a choice of strategies, but the chosen channel law does not change during the transmission of various symbols of the codeword. AVCs have been the subject of much research -the reader can find a good introduction to this topic as well as numerous pointers to the extensive literature in a survey by Lapidoth and Narayan [54]. To the author's understanding, it seems that much of the work has been of a non-constructive flavor, driven by the information-theoretic motivation of determining the capacity under different AVC variants.…”
Section: Remark 1 [Arbitrarily Varying Channel]mentioning
confidence: 99%
“…In standard information-hiding problems with a compound DMC attack channel, deterministic codes are enough to achieve capacity; random coding is used as a method of proof to establish the existence of a deterministic code without actually specifying the code [37]. In our steganography problem, a randomized code is used to satisfy the perfect-undetectability condition of (2).…”
Section: Secret Keymentioning
confidence: 99%
“…Fortunately, such things have long been studied in information theory in the context of unknown fading channels [2]. Medard in [3] examines the effect of imperfect channel knowledge on capacity, and Lapidoth and Shamai quantify the degradation in performance due to channel-state estimation errors by the receiver [4].…”
Section: Introductionmentioning
confidence: 99%
“…As just one example, control theorists are interested in knowing how networked control systems behave with or without acknowledgements of dropped packets since this is relevant for choosing among practical protocols like TCP vs. UDP [1]. Acknowledgements are a kind of sideinformation about control channel state, but as of now, there is no theoretical guidance for how to think about it in a principled way.Fortunately, such things have long been studied in information theory in the context of unknown fading channels [2]. Medard in [3] examines the effect of imperfect channel knowledge on capacity, and Lapidoth and Shamai quantify the degradation in performance due to channel-state estimation errors by the receiver [4].…”
mentioning
confidence: 99%