Cooperative Locality of Shortened Hamming Codes

Title

Cooperative Locality of Shortened Hamming Codes

 Author

Bom, Joep (TU Delft Electrical Engineering, Mathematics and Computer Science)

Contributor

Weber, Jos (mentor)

Degree granting institution

Delft University of Technology

 Date

2017-07-03

 Abstract

Binary erasure-repairing codes protect information stored on multiple servers by adding parity servers. A characteristic of a code is its cooperative locality; a measure of the amount of servers that need to be accessed to repair erased servers. This report discusses the cooperative locality of Hamming codes and shortened Hamming codes, using the row space of parity-check matrices of these codes. In some cases, an equality for this locality is found, in other cases a bound is given.

 Subject

Cooperative Locality
Hamming Code
Coding Theory
Codes
Shortened Codes
Erasure
Erasure-Repairing

 To reference this document use:

http://resolver.tudelft.nl/uuid:87a8d38c-c8f9-4ce5-952a-ffca4362fe1b

 Part of collection

Student theses

 Document type

bachelor thesis

 Rights

© 2017 Joep Bom
Files
PDF Report.pdf 428.25 KB
Close viewer