Abstract
In this, the second part of a two-part paper, we apply the result of Part I [9] to three problems in multi-user communication. 1) For the special case of the broadcast channel where both channels are binary symmetric, we establish a converse result that shows the ad hoc scheme suggested by Cover and Bergmans [2], [3l is in fact optimal. 2) For a modified version of a source coding problem with side information of Slepian and Wolf [3], we establish a converse result. 3) We show that the "common information" of a certain pair of dependent random variables is zero.
Keywords
ConverseBinary numberEntropy (arrow of time)Converse theoremMathematicsRandom variableInformation theoryComputer scienceCover (algebra)Channel codeDiscrete mathematicsTheoretical computer scienceAlgorithmDecoding methodsPure mathematicsStatistics
Related Publications
Elements of Information Theory
Preface to the Second Edition. Preface to the First Edition. Acknowledgments for the Second Edition. Acknowledgments for the First Edition. 1. Introduction and Preview. 1.1 Prev...
The discrete memoryless multiple access channel with partially cooperating encoders (Corresp.)
We introduce the communication situation in which the encoders of a multiple access channel are partially cooperating. These encoders are connected by communication links with f...
Good error-correcting codes based on very sparse matrices
We study two families of error-correcting codes defined in terms of very sparse matrices. "MN" (MacKay-Neal (1995)) codes are recently invented, and "Gallager codes" were first ...
Context-based adaptive binary arithmetic coding in the H.264/AVC video compression standard
Context-based adaptive binary arithmetic coding (CABAC) as a normative part of the new ITU-T/ISO/IEC standard H.264/AVC for video compression is presented. By combining an adapt...
An achievable rate region for the multiple-access channel with feedback
p(u)p(x,~u)p(x~~u)p(ylxl,x~), is established for the multiple-access channel with feedback. Time sharing of these achievable rates yields the rate region of this paper. This reg...
Publication Info
- Year
- 1973
- Type
- article
- Volume
- 19
- Issue
- 6
- Pages
- 772-777
- Citations
- 254
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
254
OpenAlex
Cite This
A.D. Wyner
(1973).
A theorem on the entropy of certain binary sequences and applications--II.
IEEE Transactions on Information Theory
, 19
(6)
, 772-777.
https://doi.org/10.1109/tit.1973.1055108
Identifiers
- DOI
- 10.1109/tit.1973.1055108