A Caltech Library Service

Searching for Minimum Storage Regenerating Codes


Cullina, Daniel Francis (2009) Searching for Minimum Storage Regenerating Codes. Senior thesis (Major), California Institute of Technology. doi:10.7907/ATJY-BT03.


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
Minor Option:Business Economics and Management
Thesis Availability:Public (worldwide access)
Research Advisor(s):
  • Ho, Tracey C.
Thesis Committee:
  • None, None
Defense Date:1 January 2009
Record Number:CaltechTHESIS:01262011-102713095
Persistent URL:
Cullina, Daniel Francis0000-0002-7471-2102
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:6233
Deposited By: Benjamin Perez
Deposited On:27 Jan 2011 23:54
Last Modified:07 Jun 2023 17:20

Thesis Files

PDF - Final Version
See Usage Policy.


Repository Staff Only: item control page