Variable Packet-Error Coding
Xiaoqing Fan, Oliver Kosut, Aaron B. wagner

TL;DR
This paper introduces a novel coding scheme for packet transmission that guarantees source reconstruction under adversarial errors, leveraging polytope codes and applicable to distributed storage systems.
Contribution
It proposes a new code design based on polytope codes to handle adversarial packet errors with variable distortion constraints, extending previous coding frameworks.
Findings
Code guarantees source recovery with no errors under specified distortion.
Design adapts to a different number of errors with relaxed distortion constraints.
Applicable to distributed storage systems for error resilience.
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, etc. Focusing on the special case of the erasure distortion measure, we introduce a code design based on the polytope codes of Kosut, Tong, and Tse. The resulting designs are also applied to a separate problem in distributed storage.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Advanced Data Storage Technologies · Cellular Automata and Applications
