Variable Packet-Error Coding
Reads0
Chats0
TLDR
Focusing on the special case of the erasure distortion measure, a code design based on the polytope codes of Kosut et al is introduced, which is applied to a separate problem in distributed storage.Abstract:
We consider a problem in which a source is encoded into $N$ packets, an unknown number of which are subject to adversarial errors en route to the decoder. We seek code designs for which the decoder is guaranteed to be able to reproduce the source subject to a certain distortion constraint when there are no packets errors, subject to a less stringent distortion constraint when there is one error, and so on. Focusing on the special case of the erasure distortion measure, we introduce a code design based on the polytope codes of Kosut et al. . The resulting designs are also applied to a separate problem in distributed storage.read more
Citations
More filters
Journal ArticleDOI
Coding for the Large-Alphabet Adversarial Channel
Ebad Ahmed,Aaron B. Wagner +1 more
TL;DR: It is shown that combining an optimal rate-distortion code with an optimal error-correction code yields an optimal overall code for Gaussian sources with quadratic distortion and binary uniform sources with Hamming distortion but that it can be suboptimal by an arbitrarily large factor in general.
Proceedings ArticleDOI
Gaussian variable packet-error coding
Xiaoqing Fan,Aaron B. Wagner +1 more
TL;DR: This work considers the problem of communicating a Gaussian source over several paths in a network, some unknown subset of which are subject to adversarial errors, and shows that a natural design based on error-correcting and error-detecting codes is not order-optimal in the rate.
Proceedings ArticleDOI
Resilient communication against adversarial path-errors
TL;DR: It is found that a mixture of highly redundant coding and uncoded transmission outperforms schemes that protect all of the transmitted data against adversarial attack.
Proceedings ArticleDOI
Variable Packet-Error Coding: the Point-to-Point Case
Xiaoqing Fan,Aaron B. Wagner +1 more
TL;DR: An achievable scheme is presented, which illustrates a particular mechanism for designing the codebook so as to limit the harm that can be done by the adversary, and an impossibility result is presented.
References
More filters
Book
Error Control Systems for Digital Communication and Storage
TL;DR: This work has shown that polynomials over Galois Fields, particularly the Hadamard, Quadratic Residue, and Golay Codes, are good candidates for Error Control Coding for Digital Communication Systems.
Journal ArticleDOI
Network Coding for Distributed Storage Systems
TL;DR: It is shown that there is a fundamental tradeoff between storage and repair bandwidth which is theoretically characterize using flow arguments on an appropriately constructed graph and regenerating codes are introduced that can achieve any point in this optimal tradeoff.
MonographDOI
Foundations of Cryptography
TL;DR: In this paper, the authors present a list of figures in the context of digital signatures and message authentication for general cryptographic protocols, including encryption, digital signatures, message authentication, and digital signatures.
Journal ArticleDOI
Multiple description coding: compression meets the network
TL;DR: By allowing image reconstruction to continue even after a packet is lost, this type of representation can prevent a Web browser from becoming dormant, and the source can be approximated from any subset of the chunks.
Journal ArticleDOI
A Survey on Network Codes for Distributed Storage
TL;DR: In this paper, the authors provide an overview of the research results on network coding for distributed storage systems and provide a comparison between erasure codes and network coding techniques, showing that maintenance bandwidth can be reduced by orders of magnitude compared to standard erasure code.
Related Papers (5)
Joint source-channel coding and guessing with application to sequential decoding
Erdal Arikan,Neri Merhav +1 more