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.

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 X_{1}^{n} = (X_{1}, X_{2}, ..., X_{n}) to n receivers, where receiver k is only interested in the component X_{k}. A source encoding is a binary sequence f = (f_{1}, f_{2}, ...) which is chosen by the transmitter. The expected time at which the k^{th} receiver determines X_{k} is denoted l(f, k). This means that the initial segment (f_{1}, f_{2}, ..., f_{l(f, k)}) of the encoding allows unique decoding of X_{k}. We define the performance measure L(n) = min_{f} max^{k} 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→∞} [max_{k} l(f, k)/(n + 1)/2] = 1, where n+1/2 is the arithmetic mean of the values (l(f, K))_{k=1}^{n} obtained by the naive scheme f_{k} = X_{k}. 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.