Variable Packet-Error Coding

Xiaoqing Fan; Oliver Kosut; Aaron B. Wagner

doi:10.1109/TIT.2017.2761122

Variable Packet-Error Coding

Xiaoqing Fan, Oliver Kosut, Aaron B. Wagner

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

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.

Original language	English (US)
Pages (from-to)	1530-1547
Number of pages	18
Journal	IEEE Transactions on Information Theory
Volume	64
Issue number	3
DOIs	https://doi.org/10.1109/TIT.2017.2761122
State	Published - Mar 2018

Keywords

Error correction
distributed storage systems

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/TIT.2017.2761122

Cite this

@article{85e73501c8a74d328b78cb88a7a9d2f1,

title = "Variable Packet-Error Coding",

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.",

keywords = "Error correction, distributed storage systems",

author = "Xiaoqing Fan and Oliver Kosut and Wagner, {Aaron B.}",

note = "Funding Information: Manuscript received July 30, 2016; revised June 12, 2017; accepted September 5, 2017. Date of publication October 9, 2017; date of current version February 15, 2018. This research was supported in part by the Army Research Office under Grant W911NF-13-1-0455 and in part by the National Science Foundation under Grant CCF-1117128, Grant CCF-1218578, and Grant CCF-1453718. This paper was presented in part at the 2013 IEEE International Symposium on Information Theory [1] and the 51st Annual Allerton Conference on Communications, Control, and Computing [2]. Publisher Copyright: {\textcopyright} 1963-2012 IEEE.",

year = "2018",

month = mar,

doi = "10.1109/TIT.2017.2761122",

language = "English (US)",

volume = "64",

pages = "1530--1547",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "3",

}

TY - JOUR

T1 - Variable Packet-Error Coding

AU - Fan, Xiaoqing

AU - Kosut, Oliver

AU - Wagner, Aaron B.

N1 - Funding Information: Manuscript received July 30, 2016; revised June 12, 2017; accepted September 5, 2017. Date of publication October 9, 2017; date of current version February 15, 2018. This research was supported in part by the Army Research Office under Grant W911NF-13-1-0455 and in part by the National Science Foundation under Grant CCF-1117128, Grant CCF-1218578, and Grant CCF-1453718. This paper was presented in part at the 2013 IEEE International Symposium on Information Theory [1] and the 51st Annual Allerton Conference on Communications, Control, and Computing [2]. Publisher Copyright: © 1963-2012 IEEE.

PY - 2018/3

Y1 - 2018/3

N2 - 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.

AB - 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.

KW - Error correction

KW - distributed storage systems

UR - http://www.scopus.com/inward/record.url?scp=85031826221&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85031826221&partnerID=8YFLogxK

U2 - 10.1109/TIT.2017.2761122

DO - 10.1109/TIT.2017.2761122

M3 - Article

AN - SCOPUS:85031826221

SN - 0018-9448

VL - 64

SP - 1530

EP - 1547

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 3

ER -

Variable Packet-Error Coding

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this