Alphabet-size dependent bounds for exact repair in distributed storage

Viveck Ramesh Cadambe, Arya Mazumdar

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Scopus citations


    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 languageEnglish (US)
    Title of host publicationITW 2015 - 2015 IEEE Information Theory Workshop
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Number of pages3
    ISBN (Electronic)9781467378529
    StatePublished - Dec 17 2015
    EventIEEE Information Theory Workshop, ITW 2015 - Jeju Island, Korea, Republic of
    Duration: Oct 11 2015Oct 15 2015

    Publication series

    NameITW 2015 - 2015 IEEE Information Theory Workshop


    OtherIEEE Information Theory Workshop, ITW 2015
    CountryKorea, Republic of
    CityJeju Island

    All Science Journal Classification (ASJC) codes

    • Information Systems

    Cite this