Skip to Main content Skip to Navigation
Journal articles

Incremental Coding for Extractable Compression in the Context of Massive Random Access

Abstract : In this paper, we study the problem of source coding with Massive Random Access (MRA). A set of correlated sources is encoded once for all and stored on a server while a large number of clients access various subsets of these sources. Due to the number of concurrent requests, the server is only able to extract a bitstream from the stored data: no re-encoding can be performed before the transmission of the data requested by the clients. First, we formally define the MRA framework and propose to model the constraints on the way subsets of sources may be accessed by a navigation graph. We introduce both storage and transmission costs to characterize the performance of MRA. We then propose an Incremental coding Based Extractable Compression (IBEC) scheme. We first show that this scheme is optimal in terms of achievable storage and transmission costs. Second, we propose a practical implementation of our IBEC scheme based on rate-compatible LDPC codes. Experimental results show that our IBEC scheme can almost reach the same transmission costs as in traditional point-to-point source coding schemes, while having a reasonable overhead in terms of storage cost.
Complete list of metadatas

Cited literature [39 references]  Display  Hide  Download
Contributor : Thomas Maugey <>
Submitted on : Wednesday, April 15, 2020 - 8:45:14 AM
Last modification on : Friday, July 10, 2020 - 4:21:00 PM


Files produced by the author(s)



Thomas Maugey, Aline Roumy, Elsa Dupraz, Michel Kieffer. Incremental Coding for Extractable Compression in the Context of Massive Random Access. IEEE transactions on Signal and Information Processing over Networks, IEEE, 2020, 6, pp.251-260. ⟨10.1109/TSIPN.2020.2981263⟩. ⟨hal-02542972⟩



Record views


Files downloads