On independent distributed source coding problems with exact repair

Congduan Li; Fangwei Ye; Xuan Guang; Zhiheng Zhou; Chee Wei Tan; Raymond W. Yeung

doi:10.1109/ITW.2017.8277962

On independent distributed source coding problems with exact repair

Congduan Li, Fangwei Ye, Xuan Guang, Zhiheng Zhou, Chee Wei Tan, Raymond W. Yeung

Department of Computer Science

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

Abstract

In conventional distributed storage exact repair problems, all sources are reconstructed when the decoder has access to a certain number of encoders (disks). So, the underlying reconstruction network is equivalent to a single-source problem. This paper considers a variant of the exact repair problem, where the underlying reconstruction network is the independent distributed source coding problem, a type of multi-source problem. As the first non-trivial case with two sources and three encoders, the storage-repair tradeoff regions are proved for all the 33 instances, and it is shown that binary codes are optimal.

Original language	English
Title of host publication	2017 IEEE Information Theory Workshop (ITW)
Publisher	IEEE
Pages	579-583
ISBN (Electronic)	9781509030972
ISBN (Print)	9781509030989
DOIs	https://doi.org/10.1109/ITW.2017.8277962
Publication status	Published - Nov 2017
Event	2017 IEEE Information Theory Workshop (ITW 2017) - Kaohsiung Exhibition Center (KEC), Kaohsiung, Taiwan, China Duration: 6 Nov 2017 → 10 Nov 2017 http://www.itw2017.org/

Conference

Conference	2017 IEEE Information Theory Workshop (ITW 2017)
Abbreviated title	ITW 2017
Place	Taiwan, China
City	Kaohsiung
Period	6/11/17 → 10/11/17
Internet address	http://www.itw2017.org/

Research Keywords

Distributed storage
Exact repair
Independent distributed source coding

Access Output

10.1109/ITW.2017.8277962

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{22d500ff350840ffa9e3abdc84702c5f,

title = "On independent distributed source coding problems with exact repair",

abstract = "In conventional distributed storage exact repair problems, all sources are reconstructed when the decoder has access to a certain number of encoders (disks). So, the underlying reconstruction network is equivalent to a single-source problem. This paper considers a variant of the exact repair problem, where the underlying reconstruction network is the independent distributed source coding problem, a type of multi-source problem. As the first non-trivial case with two sources and three encoders, the storage-repair tradeoff regions are proved for all the 33 instances, and it is shown that binary codes are optimal.",

keywords = "Distributed storage, Exact repair, Independent distributed source coding",

author = "Congduan Li and Fangwei Ye and Xuan Guang and Zhiheng Zhou and Tan, {Chee Wei} and Yeung, {Raymond W.}",

year = "2017",

month = nov,

doi = "10.1109/ITW.2017.8277962",

language = "English",

isbn = "9781509030989",

pages = "579--583",

booktitle = "2017 IEEE Information Theory Workshop (ITW)",

publisher = "IEEE",

address = "United States",

note = "2017 IEEE Information Theory Workshop (ITW 2017), ITW 2017 ; Conference date: 06-11-2017 Through 10-11-2017",

url = "http://www.itw2017.org/",

}

TY - GEN

T1 - On independent distributed source coding problems with exact repair

AU - Li, Congduan

AU - Ye, Fangwei

AU - Guang, Xuan

AU - Zhou, Zhiheng

AU - Tan, Chee Wei

AU - Yeung, Raymond W.

PY - 2017/11

Y1 - 2017/11

N2 - In conventional distributed storage exact repair problems, all sources are reconstructed when the decoder has access to a certain number of encoders (disks). So, the underlying reconstruction network is equivalent to a single-source problem. This paper considers a variant of the exact repair problem, where the underlying reconstruction network is the independent distributed source coding problem, a type of multi-source problem. As the first non-trivial case with two sources and three encoders, the storage-repair tradeoff regions are proved for all the 33 instances, and it is shown that binary codes are optimal.

AB - In conventional distributed storage exact repair problems, all sources are reconstructed when the decoder has access to a certain number of encoders (disks). So, the underlying reconstruction network is equivalent to a single-source problem. This paper considers a variant of the exact repair problem, where the underlying reconstruction network is the independent distributed source coding problem, a type of multi-source problem. As the first non-trivial case with two sources and three encoders, the storage-repair tradeoff regions are proved for all the 33 instances, and it is shown that binary codes are optimal.

KW - Distributed storage

KW - Exact repair

KW - Independent distributed source coding

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

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85046370166&origin=recordpage

U2 - 10.1109/ITW.2017.8277962

DO - 10.1109/ITW.2017.8277962

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9781509030989

SP - 579

EP - 583

BT - 2017 IEEE Information Theory Workshop (ITW)

PB - IEEE

T2 - 2017 IEEE Information Theory Workshop (ITW 2017)

Y2 - 6 November 2017 through 10 November 2017

ER -

On independent distributed source coding problems with exact repair

Abstract

Conference

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this