Alphabet-size dependent bounds for exact repair in distributed storage

Viveck Cadambe; Arya Mazumdar

doi:10.1109/ITWF.2015.7360722

Alphabet-size dependent bounds for exact repair in distributed storage

Viveck Cadambe, Arya Mazumdar

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Scopus citations

Abstract

We use some simple techniques to derive a universal alphabet-size dependent bound on the parameters of erasure-correcting regenerating codes. It can be shown that the well-known previous bounds are special cases of our more general bound. In certain cases our bound leads to improvement over prior results.

Original language	English (US)
Title of host publication	ITW 2015 - 2015 IEEE Information Theory Workshop
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1-3
Number of pages	3
ISBN (Electronic)	9781467378529
DOIs	https://doi.org/10.1109/ITWF.2015.7360722
State	Published - Dec 17 2015
Externally published	Yes
Event	IEEE Information Theory Workshop, ITW 2015 - Jeju Island, Korea, Republic of Duration: Oct 11 2015 → Oct 15 2015

Publication series

Name	ITW 2015 - 2015 IEEE Information Theory Workshop

Other

Other	IEEE Information Theory Workshop, ITW 2015
Country/Territory	Korea, Republic of
City	Jeju Island
Period	10/11/15 → 10/15/15

Bibliographical note

Publisher Copyright:
© 2015 IEEE.

Publisher link

10.1109/ITWF.2015.7360722

Find It

Find It at U of M Libraries

Cite this

Alphabet-size dependent bounds for exact repair in distributed storage. / Cadambe, Viveck; Mazumdar, Arya.
ITW 2015 - 2015 IEEE Information Theory Workshop. Institute of Electrical and Electronics Engineers Inc., 2015. p. 1-3 7360722 (ITW 2015 - 2015 IEEE Information Theory Workshop).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Cadambe, V & Mazumdar, A 2015, Alphabet-size dependent bounds for exact repair in distributed storage. in ITW 2015 - 2015 IEEE Information Theory Workshop., 7360722, ITW 2015 - 2015 IEEE Information Theory Workshop, Institute of Electrical and Electronics Engineers Inc., pp. 1-3, IEEE Information Theory Workshop, ITW 2015, Jeju Island, Korea, Republic of, 10/11/15. https://doi.org/10.1109/ITWF.2015.7360722

@inproceedings{f42ef7f472634ac7a01aed7993d98b62,

title = "Alphabet-size dependent bounds for exact repair in distributed storage",

abstract = "We use some simple techniques to derive a universal alphabet-size dependent bound on the parameters of erasure-correcting regenerating codes. It can be shown that the well-known previous bounds are special cases of our more general bound. In certain cases our bound leads to improvement over prior results.",

author = "Viveck Cadambe and Arya Mazumdar",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; IEEE Information Theory Workshop, ITW 2015 ; Conference date: 11-10-2015 Through 15-10-2015",

year = "2015",

month = dec,

day = "17",

doi = "10.1109/ITWF.2015.7360722",

language = "English (US)",

series = "ITW 2015 - 2015 IEEE Information Theory Workshop",

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

pages = "1--3",

booktitle = "ITW 2015 - 2015 IEEE Information Theory Workshop",

}

TY - GEN

T1 - Alphabet-size dependent bounds for exact repair in distributed storage

AU - Cadambe, Viveck

AU - Mazumdar, Arya

PY - 2015/12/17

Y1 - 2015/12/17

N2 - We use some simple techniques to derive a universal alphabet-size dependent bound on the parameters of erasure-correcting regenerating codes. It can be shown that the well-known previous bounds are special cases of our more general bound. In certain cases our bound leads to improvement over prior results.

AB - We use some simple techniques to derive a universal alphabet-size dependent bound on the parameters of erasure-correcting regenerating codes. It can be shown that the well-known previous bounds are special cases of our more general bound. In certain cases our bound leads to improvement over prior results.

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

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

U2 - 10.1109/ITWF.2015.7360722

DO - 10.1109/ITWF.2015.7360722

M3 - Conference contribution

AN - SCOPUS:84962689640

T3 - ITW 2015 - 2015 IEEE Information Theory Workshop

SP - 1

EP - 3

BT - ITW 2015 - 2015 IEEE Information Theory Workshop

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - IEEE Information Theory Workshop, ITW 2015

Y2 - 11 October 2015 through 15 October 2015

ER -

Alphabet-size dependent bounds for exact repair in distributed storage

Abstract

Publication series

Other

Bibliographical note

Publisher link

Find It

Other files and links

Fingerprint

Cite this