Campus Units

Electrical and Computer Engineering, Mathematics

Document Type

Conference Proceeding


2013 IEEE International Symposium on Network Coding

Publication Version

Accepted Manuscript

Link to Published Version

Publication Date


Journal or Book Title

2013 International Symposium on Network Coding (NetCod)



Conference Title

2013 IEEE International Symposium on Network Coding

Conference Date

June 7-9, 2013


Calgary, AB, Canada


We consider the design of regenerating codes for distributed storage systems that enjoy the property of local, exact and uncoded repair, i.e., (a) upon failure, a node can be regenerated by simply downloading packets from the surviving nodes and (b) the number of surviving nodes contacted is strictly smaller than the number of nodes that need to be contacted for reconstructing the stored file. Our codes consist of an outer MDS code and an inner fractional repetition code that specifies the placement of the encoded symbols on the storage nodes. For our class of codes, we identify the tradeoff between the local repair property and the minimum distance. We present codes based on graphs of high girth, affine resolvable designs and projective planes that meet the minimum distance bound for specific choices of file sizes.


This is a manuscript of a proceeding from the IEEE International Symposium on Network Coding (2013), doi:10.1109/NetCod.2013.6570830. Posted with permission.


Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Copyright Owner




File Format


Published Version


Article Location