To Get a Bit of Information May Be As Hard As to Get Full Information

Rudolf Ahlswede, I. Csiszár

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

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 wants 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 functions must 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 completely 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.

Original languageEnglish
Pages (from-to)398-408
Number of pages11
JournalIEEE Transactions on Information Theory
Volume27
Issue number4
DOIs
Publication statusPublished - 1981

Fingerprint

Hamming distance
coding
Chemical analysis
Values

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Library and Information Sciences
  • Electrical and Electronic Engineering

Cite this

To Get a Bit of Information May Be As Hard As to Get Full Information. / Ahlswede, Rudolf; Csiszár, I.

In: IEEE Transactions on Information Theory, Vol. 27, No. 4, 1981, p. 398-408.

Research output: Contribution to journalArticle

@article{91c28a6d0d3b4247b8ea6b4c24038de5,
title = "To Get a Bit of Information May Be As Hard As to Get Full Information",
abstract = "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 wants 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 functions must 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 completely 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.",
author = "Rudolf Ahlswede and I. Csisz{\'a}r",
year = "1981",
doi = "10.1109/TIT.1981.1056381",
language = "English",
volume = "27",
pages = "398--408",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - To Get a Bit of Information May Be As Hard As to Get Full Information

AU - Ahlswede, Rudolf

AU - Csiszár, I.

PY - 1981

Y1 - 1981

N2 - 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 wants 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 functions must 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 completely 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.

AB - 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 wants 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 functions must 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 completely 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.

UR - http://www.scopus.com/inward/record.url?scp=0019584491&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019584491&partnerID=8YFLogxK

U2 - 10.1109/TIT.1981.1056381

DO - 10.1109/TIT.1981.1056381

M3 - Article

VL - 27

SP - 398

EP - 408

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 4

ER -