Repair Rates for Multiple Descriptions on Distributed Storage
In a traditional distributed storage system, a source can be restored perfectly when a certain subset of servers is contacted. The coding is independent of the contents of the source. This paper considers instead a lossy source coding version of this problem where the more servers that are contacted...
Main Authors: | Anders Høst-Madsen, Heecheol Yang, Minchul Kim, Jungwoo Lee |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-04-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/24/5/612 |
Similar Items
-
Lossy Compression of Individual Sequences Revisited: Fundamental Limits of Finite-State Encoders
by: Neri Merhav
Published: (2024-01-01) -
A Universal Random Coding Ensemble for Sample-Wise Lossy Compression
by: Neri Merhav
Published: (2023-08-01) -
Unbalanced Multiple-Description Video Coding with Rate-Distortion Optimization
by: Singh Raghavendra, et al.
Published: (2003-01-01) -
Lossy P-LDPC Codes for Compressing General Sources Using Neural Networks
by: Jinkai Ren, et al.
Published: (2023-01-01) -
The Efficient Design of Lossy P-LDPC Codes over AWGN Channels
by: Runfeng Wang, et al.
Published: (2022-10-01)