NUK - logo
E-viri
Celotno besedilo
Recenzirano
  • Coding for computing
    Orlitsky, A.; Roche, J.R.

    IEEE transactions on information theory, 03/2001, Letnik: 47, Številka: 3
    Journal Article

    A sender communicates with a receiver who wishes to reliably evaluate a function of their combined data. We show that if only the sender can transmit, the number of bits required is a conditional entropy of a naturally defined graph. We also determine the number of bits needed when the communicators exchange two messages.