A Caltech Library Service

Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios

Chen, Shuqing and Effros, Michelle and Kostina, Victoria (2020) Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios. IEEE Transactions on Information Theory . ISSN 0018-9448. (In Press)

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


This work studies point-to-point, multiple access, and random access lossless source coding in the finite-blocklength regime. In each scenario, a random coding technique is developed and used to analyze third-order coding performance. Asymptotic results include a third-order characterization of the Slepian-Wolf rate region with an improved converse that relies on a connection to composite hypothesis testing. For dependent sources, the result implies that the independent encoders used by Slepian-Wolf codes can achieve the same third-order-optimal performance as a single joint encoder. The concept of random access source coding is introduced to generalize multiple access (Slepian-Wolf) source coding to the case where encoders decide independently whether or not to participate and the set of participating encoders is unknown a priori to both the encoders and the decoder. The proposed random access source coding strategy employs rateless coding with scheduled feedback. A random coding argument proves the existence of a single deterministic code of this structure that simultaneously achieves the third-order-optimal Slepian- Wolf performance for each possible active encoder set.

Item Type:Article
Related URLs:
URLURL TypeDescription ItemConference Paper ItemCode
Kostina, Victoria0000-0002-2406-7440
Additional Information:© 2020 IEEE. This work is supported in part by the National Science Foundation under Grants CCF-1817241 and CCF-1956386. The work of S. Chen is supported in part by the Oringer Fellowship Fund in Information Science and Technology. This paper was presented in part at the 2019 IEEE International Symposium on Information Theory, Paris, France, [1]. Matlab code for the computation of nonasymptotic bounds in this paper is available at github [2].
Funding AgencyGrant Number
Oringer Fellowship Fund, CaltechUNSPECIFIED
Record Number:CaltechAUTHORS:20200723-131543186
Persistent URL:
Official Citation:S. Chen, M. Effros and V. Kostina, "Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios," in IEEE Transactions on Information Theory, doi: 10.1109/TIT.2020.3005155
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:104542
Deposited By: Tony Diaz
Deposited On:23 Jul 2020 20:37
Last Modified:23 Jul 2020 20:37

Repository Staff Only: item control page