Channels that die
Given the possibility of communication systems failing catastrophically, we investigate limits to communicating over channels that fail at random times. These channels are finite-state semi-Markov channels. We show that communication with arbitrarily small probability of error is not possible. Makin...
Main Authors: | Goyal, Vivek K., Mitter, Sanjoy K., Varshney, Lav Raj |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers
2010
|
Online Access: | http://hdl.handle.net/1721.1/60318 https://orcid.org/0000-0002-8619-1295 |
Similar Items
-
Malleable coding with edit-distance cost
by: Goyal, Vivek K., et al.
Published: (2010) -
Distributed scalar quantization for computing: High-resolution analysis and extensions
by: Misra, Vinith, et al.
Published: (2012) -
Optimal information storage : nonsequential sources and neural channels
by: Varshney, Lav R. (Lav Raj)
Published: (2007) -
On concentric spherical codes and permutation codes with multiple initial codewords
by: Nguyen, Ha Quy, et al.
Published: (2010) -
Frame permutation quantization
by: Nguyen, Ha Q., et al.
Published: (2012)