Fair noiseless broadcast source coding

Boztas, S 2003, 'Fair noiseless broadcast source coding', in A. Tantaway and K. Inan (ed.) Proceedings of the Eighth IEEE Symposium on Computers and Communications, Kemer-Antalya, Turkey, 2003, pp. 1292-1296.

Document type: Conference Paper
Collection: Conference Papers

Title Fair noiseless broadcast source coding
Author(s) Boztas, S
Year 2003
Conference name Eighth IEEE Symposium on Computers and Communications
Conference location Kemer-Antalya, Turkey
Conference dates 2003
Proceedings title Proceedings of the Eighth IEEE Symposium on Computers and Communications
Editor(s) A. Tantaway
K. Inan
Publisher IEEE
Place of publication Los Alamitos, USA
Start page 1292
End page 1296
Abstract We present a noiseless source coding problem in a broadcast environment and supply a simple solution to this problem. A transmitter wishes to transmit a binary random vector X1n = (X1, X2, ..., Xn) to n receivers, where receiver k is only interested in the component Xk. A source encoding is a binary sequence f = (f1, f2, ...) which is chosen by the transmitter. The expected time at which the kth receiver determines Xk is denoted l(f, k). This means that the initial segment (f1, f2, ..., fl(f, k)) of the encoding allows unique decoding of Xk. We define the performance measure L(n) = minf maxk l(f, k), where the minimization is over all possible encoding, and wish to approach it by practical schemes. For the case of independent but not necessarily identically distributed Bernoulli sources, we demonstrate encoding scheme f for which; lim n→∞ [maxk l(f, k)/(n + 1)/2] = 1, where n+1/2 is the arithmetic mean of the values (l(f, K))k=1n obtained by the naive scheme fk = Xk. In the naive scheme, the worst case receiver learns its value only after n bits have been received, so this is a substantial improvement. In conclusion, we constructively establish that the inequality L(n) < _ n+3/2 holds for stationary, ergodic and bitwise independent sources. We also generalize our results to the case where each receiver is interested in a block of data, as opposed to only one bit. The determination of flower bounds on L(n) is still open.
Subjects Calculus of Variations, Systems Theory and Control Theory
Keyword(s) minimisation
source coding
DOI - identifier 10.1109/ISCC.2003.1214292
Copyright notice © 2003 IEEE
ISBN 076951961X
Version Filter Type
Altmetric details:
Access Statistics: 137 Abstract Views  -  Detailed Statistics
Created: Thu, 01 Apr 2010, 11:34:28 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us