To get a bit of information may be as hard as to get full information

Ahlswede R, Csiszár I (1981)
IEEE transactions on information theory 27(4): 398-408.

Download
OA
Zeitschriftenaufsatz | Veröffentlicht | Englisch
Volltext vorhanden für diesen Nachweis
Autor
;
Abstract / Bemerkung
The following coding problem for correlated discrete memoryless sources is considered. The two sources can be separately block encoded, and the values of the encoding functions are available to a decoder who wnats to answer a certain question concerning the source outputs. Typically, this question has only a few possible answers (even as few as two). The rates of the encoding functionsmust be found that enable the decoder to answer this question correctly with high probability. It is proven that these rates are often as large as those needed for a full reproduction of the outputs of both sources. Furthermore, if one source is comletely known at the decoder, this phenomenon already occurs when what is asked for is the joint type (joint composition) of the two source output blocks, or some function thereof such as the Hamming distance of the two blocks or (for alphabet size at least three) just the parity of this Hamming distance.
Erscheinungsjahr
Zeitschriftentitel
IEEE transactions on information theory
Band
27
Zeitschriftennummer
4
Seite
398-408
ISSN
PUB-ID

Zitieren

Ahlswede R, Csiszár I. To get a bit of information may be as hard as to get full information. IEEE transactions on information theory. 1981;27(4):398-408.
Ahlswede, R., & Csiszár, I. (1981). To get a bit of information may be as hard as to get full information. IEEE transactions on information theory, 27(4), 398-408. doi:10.1109/TIT.1981.1056381
Ahlswede, R., and Csiszár, I. (1981). To get a bit of information may be as hard as to get full information. IEEE transactions on information theory 27, 398-408.
Ahlswede, R., & Csiszár, I., 1981. To get a bit of information may be as hard as to get full information. IEEE transactions on information theory, 27(4), p 398-408.
R. Ahlswede and I. Csiszár, “To get a bit of information may be as hard as to get full information”, IEEE transactions on information theory, vol. 27, 1981, pp. 398-408.
Ahlswede, R., Csiszár, I.: To get a bit of information may be as hard as to get full information. IEEE transactions on information theory. 27, 398-408 (1981).
Ahlswede, Rudolf, and Csiszár, Imre. “To get a bit of information may be as hard as to get full information”. IEEE transactions on information theory 27.4 (1981): 398-408.
Alle Dateien verfügbar unter der/den folgenden Lizenz(en):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Volltext(e)
Access Level
OA Open Access
Zuletzt Hochgeladen
1970-01-01T00:00:00Z