About priority encoding transmission
Stéphane Boucheron, Kavé Salamatian · IEEE Transactions on Information Theory · 2000
Albanese et al. (see ibid. vol.42, p.1737-44, 1996) introduced priority encoding transmission (PET) for sending hierarchically organized messages over lossy packet-based computer networks. In a PET system, each symbol in the message is assigned a priority which determines the minimal number of codeword symbols that is required to recover that symbol. This article revisits the PET approach using tools from network information theory. We first show that priority encoding transmission is intimately related with the broadcast erasure channel with a degraded message set. Using the information spectrum approach, we provide an informational characterization of the capacity region of general broadcast channels with degraded message set. We show that the PET inequality has an information-theoretical counterpart. The inequality defining the capacity region of the broadcast erasure channel with degraded message sets. Hence the PET approach which consists in time-sharing and interleaving classical erasure-resilient codes achieves the capacity region of this channel. Moreover, we show that the PET approach may achieve the sphere packing exponents. Finally, we observe that on some simple nonstationary broadcast channels, time-sharing may be outperformed. The impact of memory on the optimality of the PET approach remains elusive.
Cited by 54 works. doi:10.1109/18.825846
Authors
References
- Elements of Information Theory
- Information Theory and Reliable Communication.
- Information Theory: Coding Theorems for Discrete Memoryless Systems
- Broadcast channels
- Information Theory and Reliable Communication
- Measurements and analysis of end-to-end Internet dynamics
- A general formula for channel capacity
- General broadcast channels with degraded message sets
- Priority encoding transmission
- Some intersection theorems for ordered sets and graphs