Codes with efficient erasure correction

dc.contributor.advisorBarg, Alexanderen_US
dc.contributor.authorChen, Zitanen_US
dc.contributor.departmentElectrical Engineeringen_US
dc.contributor.publisherDigital Repository at the University of Marylanden_US
dc.contributor.publisherUniversity of Maryland (College Park, Md.)en_US
dc.description.abstractDistributed storage systems are becoming increasingly ubiquitous in the emerging era of Internet of Things. Major internet technology companies employ large-scale distributed storage systems to accommodate the massive amounts of data generated and requested by global users. The need of reliable and efficient storage of immense amounts of data calls for new applications and development of classical error-correcting codes. This dissertation is devoted to a study of codes with efficient erasure correction for distributed storage systems. The efficiency of erasure correction is often assessed by two performance metrics, bandwidth and locality. In this dissertation we address several problems for each of these two metrics. We construct families of codes with optimal communication complexity for erasure correction ("repair bandwidth") for a heterogeneous storage model, and derive several results for the problem of optimal repair of Reed-Solomon codes. We also construct families of cyclic and convolutional codes with locality, extending the range of parameters for which such families were previously known.en_US
dc.subject.pqcontrolledElectrical engineeringen_US
dc.subject.pquncontrolledCoding theoryen_US
dc.subject.pquncontrolledDistributed storageen_US
dc.subject.pquncontrolledErasure codesen_US
dc.subject.pquncontrolledReed-Solomon codesen_US
dc.subject.pquncontrolledRepair bandwidthen_US
dc.titleCodes with efficient erasure correctionen_US


Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
1.02 MB
Adobe Portable Document Format