Chen, Shuqing and Effros, Michelle and Kostina, Victoria (2019) Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios. In: 2019 IEEE International Symposium on Information Theory (ISIT). IEEE , Piscataway, NJ, pp. 1692-1696. ISBN 978-1-5386-9291-2. https://resolver.caltech.edu/CaltechAUTHORS:20190402-132221601
![]() |
PDF
- Submitted Version
See Usage Policy. 1MB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20190402-132221601
Abstract
This paper treats point-to-point, multiple access and random access lossless source coding in the finite-blocklength regime. A random coding technique is developed, and its power in analyzing the third-order coding performance is demonstrated in all three scenarios. Results include a third-order-optimal characterization of the Slepian-Wolf rate region and a proof showing that for dependent sources, 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, which generalizes the multiple access scenario to allow for a subset of participating encoders that is unknown a priori to both the encoders and the decoder, is introduced. Contributions include a new definition of the probabilistic model for a random access-discrete multiple source, a general random access source coding scheme that employs a rateless code with sporadic feedback, and an analysis demonstrating via a random coding argument that there exists a deterministic code of the proposed structure that simultaneously achieves the third- order-optimal performance of Slepian-Wolf codes for all possible subsets of encoders.
Item Type: | Book Section | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Related URLs: |
| ||||||||||||
ORCID: |
| ||||||||||||
Additional Information: | © 2019 IEEE. This work is supported in part by the National Science Foundation under Grant CCF-1817241. The work of S. Chen is supported in part by the Oringer Fellowship Fund in Information Science and Technology. | ||||||||||||
Funders: |
| ||||||||||||
Subject Keywords: | Lossless source coding, Slepian-Wolf, random access, finite blocklength, random coding, non-asymptotic information theory, Gaussian approximation | ||||||||||||
DOI: | 10.1109/ISIT.2019.8849742 | ||||||||||||
Record Number: | CaltechAUTHORS:20190402-132221601 | ||||||||||||
Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20190402-132221601 | ||||||||||||
Official Citation: | S. Chen, M. Effros and V. Kostina, "Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios," 2019 IEEE International Symposium on Information Theory (ISIT), Paris, France, 2019, pp. 1692-1696. doi: 10.1109/ISIT.2019.8849742 | ||||||||||||
Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | ||||||||||||
ID Code: | 94369 | ||||||||||||
Collection: | CaltechAUTHORS | ||||||||||||
Deposited By: | Tony Diaz | ||||||||||||
Deposited On: | 02 Apr 2019 21:45 | ||||||||||||
Last Modified: | 16 Nov 2021 17:04 |
Repository Staff Only: item control page