Channels that die

Authors:
Lav R. Varshney;Sanjoy K. Mitter;Vivek K. Goyal
Affiliations:
Laboratory for Information and Decision Systems, Massachusetts Institute of Technology and Research Laboratory of Electronics, Massachusetts Institute of Technology;Laboratory for Information and Decision Systems, Massachusetts Institute of Technology;Research Laboratory of Electronics, Massachusetts Institute of Technology
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 11
Cited 0

An adaptive algorithm for optimizing the packet size used in wireless ARQ protocols

Wireless Networks
Information Theory and Reliable Communication

Information Theory and Reliable Communication
Wireless Communications

Wireless Communications
Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics)

Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics)
On the lifetime of wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)
Tracking stopping times through noisy observations

IEEE Transactions on Information Theory
Channels that heat up

IEEE Transactions on Information Theory
Capacity, mutual information, and coding for finite-state Markov channels

IEEE Transactions on Information Theory
A comparison of known codes, random codes, and the best codes

IEEE Transactions on Information Theory
Distance distribution of binary codes and the error probability of decoding

IEEE Transactions on Information Theory
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Gven 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. 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.