By Topic

About priority encoding transmission

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. Boucheron ; Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay, France ; M. R. Salamatian

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

Published in:

IEEE Transactions on Information Theory  (Volume:46 ,  Issue: 2 )