Linear Programming Bounds for Storage Codes

Terence H. Chan; Mohammad Ali Tebbi; Chi Wan Sung

doi:10.1109/ICICS.2013.6782924

Linear Programming Bounds for Storage Codes

Terence H. Chan
, Mohammad Ali Tebbi
, Chi Wan Sung

Department of Electrical Engineering

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

5 Citations (Scopus)

Abstract

Extending Delsarte's linear programming bound for error correcting codes, this paper obtains a linear programming bound for locally repairable storage codes. The number of variables involved in the bound scales linearity with the size of the code. The bound can also be viewed as a necessary condition for the existence of a storage code and be used to characterise the tradeoff among the costs for storage, repair and update.

Original language	English
Title of host publication	ICICS 2013 - Conference Guide of The 9^th International Conference on Information, Communications and Signal Processing
Publisher	IEEE Computer Society
ISBN (Electronic)	9781479904341
ISBN (Print)	9781479904334, 9781479904327
DOIs	https://doi.org/10.1109/ICICS.2013.6782924
Publication status	Published - Dec 2013
Event	9^th International Conference on Information, Communications and Signal Processing (ICICS 2013) - Shangri-La Far Eastern Plaza Hotel, Tainan, Taiwan, China Duration: 10 Dec 2013 → 13 Dec 2013

Conference

Conference	9^th International Conference on Information, Communications and Signal Processing (ICICS 2013)
Place	Taiwan, China
City	Tainan
Period	10/12/13 → 13/12/13

Access Output

10.1109/ICICS.2013.6782924

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{e1607afd17d141c0a1d17fd2ad7d5c7c,

title = "Linear Programming Bounds for Storage Codes",

abstract = "Extending Delsarte's linear programming bound for error correcting codes, this paper obtains a linear programming bound for locally repairable storage codes. The number of variables involved in the bound scales linearity with the size of the code. The bound can also be viewed as a necessary condition for the existence of a storage code and be used to characterise the tradeoff among the costs for storage, repair and update.",

author = "Chan, \{Terence H.\} and Tebbi, \{Mohammad Ali\} and Sung, \{Chi Wan\}",

year = "2013",

month = dec,

doi = "10.1109/ICICS.2013.6782924",

language = "English",

isbn = "9781479904334",

booktitle = "ICICS 2013 - Conference Guide of The 9th International Conference on Information, Communications and Signal Processing",

publisher = "IEEE Computer Society",

address = "United States",

note = "9<sup>th</sup> International Conference on Information, Communications and Signal Processing (ICICS 2013) ; Conference date: 10-12-2013 Through 13-12-2013",

}

Chan, TH, Tebbi, MA & Sung, CW 2013, Linear Programming Bounds for Storage Codes. in ICICS 2013 - Conference Guide of The 9^th International Conference on Information, Communications and Signal Processing., 6782924, IEEE Computer Society, 9^th International Conference on Information, Communications and Signal Processing (ICICS 2013), Tainan, Taiwan, China, 10/12/13. https://doi.org/10.1109/ICICS.2013.6782924

Linear Programming Bounds for Storage Codes. / Chan, Terence H.; Tebbi, Mohammad Ali; Sung, Chi Wan.
ICICS 2013 - Conference Guide of The 9^th International Conference on Information, Communications and Signal Processing. IEEE Computer Society, 2013. 6782924.

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

TY - GEN

T1 - Linear Programming Bounds for Storage Codes

AU - Chan, Terence H.

AU - Tebbi, Mohammad Ali

AU - Sung, Chi Wan

PY - 2013/12

Y1 - 2013/12

N2 - Extending Delsarte's linear programming bound for error correcting codes, this paper obtains a linear programming bound for locally repairable storage codes. The number of variables involved in the bound scales linearity with the size of the code. The bound can also be viewed as a necessary condition for the existence of a storage code and be used to characterise the tradeoff among the costs for storage, repair and update.

AB - Extending Delsarte's linear programming bound for error correcting codes, this paper obtains a linear programming bound for locally repairable storage codes. The number of variables involved in the bound scales linearity with the size of the code. The bound can also be viewed as a necessary condition for the existence of a storage code and be used to characterise the tradeoff among the costs for storage, repair and update.

UR - https://www.scopus.com/pages/publications/84899124579

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

U2 - 10.1109/ICICS.2013.6782924

DO - 10.1109/ICICS.2013.6782924

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

SN - 9781479904334

SN - 9781479904327

BT - ICICS 2013 - Conference Guide of The 9th International Conference on Information, Communications and Signal Processing

PB - IEEE Computer Society

T2 - 9<sup>th</sup> International Conference on Information, Communications and Signal Processing (ICICS 2013)

Y2 - 10 December 2013 through 13 December 2013

ER -

Linear Programming Bounds for Storage Codes

Abstract

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this