Applications of polymatroid theory to distributed storage systems

 |  Login

Show simple item record

dc.contributor Aalto-yliopisto fi
dc.contributor Aalto University en
dc.contributor.author Westerbäck, Thomas
dc.contributor.author Freij-Hollanti, Ragnar
dc.contributor.author Hollanti, Camilla
dc.date.accessioned 2017-08-03T12:09:21Z
dc.date.available 2017-08-03T12:09:21Z
dc.date.issued 2016-04-04
dc.identifier.citation Westerbäck , T , Freij-Hollanti , R & Hollanti , C 2016 , Applications of polymatroid theory to distributed storage systems . in 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015 . , 7447009 , Institute of Electrical and Electronics Engineers Inc. , pp. 231-237 , Allerton Conference on Communication, Control, and Computing , Monticello , United States , 29-2 October . DOI: 10.1109/ALLERTON.2015.7447009 en
dc.identifier.isbn 9781509018239
dc.identifier.isbn 978-1-5090-1824-6
dc.identifier.other PURE UUID: 7d26eed5-819d-43f1-96b7-bbdef87dc09e
dc.identifier.other PURE ITEMURL: https://research.aalto.fi/en/publications/applications-of-polymatroid-theory-to-distributed-storage-systems(7d26eed5-819d-43f1-96b7-bbdef87dc09e).html
dc.identifier.other PURE LINK: http://www.scopus.com/inward/record.url?scp=84969855941&partnerID=8YFLogxK
dc.identifier.other PURE FILEURL: https://research.aalto.fi/files/14353559/Applications_of_polymatroid_theory_to_distributed_storage_systems.pdf
dc.identifier.uri https://aaltodoc.aalto.fi/handle/123456789/27391
dc.description.abstract In this paper, a link between polymatroid theory and locally repairable codes (LRCs) is established. The codes considered here are completely general in that they are subsets of An, where A is an arbitrary finite set. Three classes of LRCs are considered, both with and without availability, and for both information-symbol and all-symbol locality. The parameters and classes of LRCs are generalized to polymatroids, and a generalized Singelton bound on the parameters for these three classes of polymatroids and LRCs is given. This result generalizes the earlier Singleton-type bounds given for LRCs. Codes achieving these bounds are coined perfect, as opposed to the more common term optimal used earlier, since they might not always exist. Finally, new constructions of perfect linear LRCs are derived from gammoids, which are a special class of matroids. Matroids, for their part, form a subclass of polymatroids and have proven useful in analyzing and constructing linear LRCs. en
dc.format.extent 7
dc.format.extent 231-237
dc.format.mimetype application/pdf
dc.language.iso en en
dc.relation.ispartof Allerton Conference on Communication, Control, and Computing en
dc.relation.ispartofseries 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015 en
dc.rights openAccess en
dc.subject.other Computer Networks and Communications en
dc.subject.other Computer Science Applications en
dc.subject.other Control and Systems Engineering en
dc.subject.other 111 Mathematics en
dc.subject.other 113 Computer and information sciences en
dc.subject.other 512 Business and management en
dc.subject.other 112 Statistics and probability en
dc.title Applications of polymatroid theory to distributed storage systems en
dc.type A4 Artikkeli konferenssijulkaisussa fi
dc.description.version Peer reviewed en
dc.contributor.department Department of Mathematics and Systems Analysis
dc.contributor.department Department of Communications and Networking
dc.subject.keyword Computer Networks and Communications
dc.subject.keyword Computer Science Applications
dc.subject.keyword Control and Systems Engineering
dc.subject.keyword 111 Mathematics
dc.subject.keyword 113 Computer and information sciences
dc.subject.keyword 512 Business and management
dc.subject.keyword 112 Statistics and probability
dc.identifier.urn URN:NBN:fi:aalto-201708036359
dc.identifier.doi 10.1109/ALLERTON.2015.7447009
dc.type.version acceptedVersion


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search archive


Advanced Search

article-iconSubmit a publication

Browse

My Account