Cullina, Daniel Francis (2009) Searching for minimum storage regenerating codes. Senior thesis (Major), California Institute of Technology. http://resolver.caltech.edu/CaltechTHESIS:01262011-102713095
Regenerating codes allow distributed storage systems to recover from the loss of a storage node while transmitting the minimum possible amount of data across the network. We search for examples of Minimum Storage Regenerating Codes. To exhaustively search the space of potential codes, we reduce the potential search space in several ways. We impose an additional symmetry condition on codes that we consider. We specify codes in a simple alternative way, using additional recovered coefficients rather than transmission coefficients. We place codes into equivalence classes to avoid redundant checking. We find MSR codes for the parameters n = 5 and k = 3 in various fields. We demonstrate that it is possible for such codes to be composed of vectors in general position.
|Item Type:||Thesis (Senior thesis (Major))|
|Subject Keywords:||Electrical Engineering|
|Degree Grantor:||California Institute of Technology|
|Division:||Engineering and Applied Science|
|Major Option:||Electrical Engineering|
|Thesis Availability:||Public (worldwide access)|
|Defense Date:||1 January 2009|
|Default Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Benjamin Perez|
|Deposited On:||27 Jan 2011 23:54|
|Last Modified:||26 Dec 2012 04:33|
- Final Version
See Usage Policy.
Repository Staff Only: item control page