Channels that die

Lav R. Varshney; Sanjoy K. Mitter; Vivek K. Goyal

doi:10.1109/ALLERTON.2009.5394908

Channels that die

Lav R. Varshney
, Sanjoy K. Mitter
, Vivek K. Goyal

Office of the Provost

Massachusetts Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

Abstract

Given the possibility of communication systems failing catastrophically, we investigate limits to communicating over channels that fail at random times. These channels are finitestate semi-Markov channels. We show that communication with arbitrarily small probability of error is not possible. Making use of results in finite blocklength channel coding, we determine sequences of blocklengths that optimize transmission volume communicated at fixed maximum message error probabilities. A dynamic programming formulation is used to show that channel state feedback does not improve performance.

Original language	English
Title of host publication	2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
Pages	566-573
Number of pages	8
DOIs	https://doi.org/10.1109/ALLERTON.2009.5394908
State	Published - 2009
Event	2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 - Monticello, IL, United States Duration: Sep 30 2009 → Oct 2 2009

Publication series

Name	2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Conference

Conference	2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
Country/Territory	United States
City	Monticello, IL
Period	09/30/09 → 10/2/09

Access to Document

10.1109/ALLERTON.2009.5394908

Cite this

@inproceedings{cae3ca7b70f44611ac30ca196b0c8c0d,

title = "Channels that die",

abstract = "Given the possibility of communication systems failing catastrophically, we investigate limits to communicating over channels that fail at random times. These channels are finitestate semi-Markov channels. We show that communication with arbitrarily small probability of error is not possible. Making use of results in finite blocklength channel coding, we determine sequences of blocklengths that optimize transmission volume communicated at fixed maximum message error probabilities. A dynamic programming formulation is used to show that channel state feedback does not improve performance.",

author = "Varshney, \{Lav R.\} and Mitter, \{Sanjoy K.\} and Goyal, \{Vivek K.\}",

year = "2009",

doi = "10.1109/ALLERTON.2009.5394908",

language = "English",

isbn = "9781424458714",

series = "2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009",

pages = "566--573",

booktitle = "2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009",

note = "2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 ; Conference date: 30-09-2009 Through 02-10-2009",

}

Varshney, LR, Mitter, SK & Goyal, VK 2009, Channels that die. in 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009., 5394908, 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, pp. 566-573, 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, Monticello, IL, United States, 09/30/09. https://doi.org/10.1109/ALLERTON.2009.5394908

Channels that die. / Varshney, Lav R.; Mitter, Sanjoy K.; Goyal, Vivek K.
2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009. 2009. p. 566-573 5394908 (2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Channels that die

AU - Varshney, Lav R.

AU - Mitter, Sanjoy K.

AU - Goyal, Vivek K.

PY - 2009

Y1 - 2009

N2 - Given the possibility of communication systems failing catastrophically, we investigate limits to communicating over channels that fail at random times. These channels are finitestate semi-Markov channels. We show that communication with arbitrarily small probability of error is not possible. Making use of results in finite blocklength channel coding, we determine sequences of blocklengths that optimize transmission volume communicated at fixed maximum message error probabilities. A dynamic programming formulation is used to show that channel state feedback does not improve performance.

AB - Given the possibility of communication systems failing catastrophically, we investigate limits to communicating over channels that fail at random times. These channels are finitestate semi-Markov channels. We show that communication with arbitrarily small probability of error is not possible. Making use of results in finite blocklength channel coding, we determine sequences of blocklengths that optimize transmission volume communicated at fixed maximum message error probabilities. A dynamic programming formulation is used to show that channel state feedback does not improve performance.

UR - https://www.scopus.com/pages/publications/77949618605

U2 - 10.1109/ALLERTON.2009.5394908

DO - 10.1109/ALLERTON.2009.5394908

M3 - Conference contribution

AN - SCOPUS:77949618605

SN - 9781424458714

T3 - 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

SP - 566

EP - 573

BT - 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

T2 - 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Y2 - 30 September 2009 through 2 October 2009

ER -

Channels that die

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this