# Channels That Die

Source: [Channels That Die](<https://www.sota2.com/research/paper/68fa51a51e209131ce975800>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T11:31:06.374Z

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

Published: 2011-06-10T13:49:15.000Z

## Abstract

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. 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. We provide a partial ordering of communication channels. A dynamic programming formulation is used to show the structural result that channel state feedback does not improve performance.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1106.2055>)

[PDF](<https://arxiv.org/pdf/1106.2055.pdf>)
