Cooperative Locality of Shortened Hamming Codes

Bachelor thesis (2017)

Authors

J. Bom Electrical Engineering, Mathematics and Computer Science

Contributors

J.H. Weber (supervisor 1)
Faculty
Electrical Engineering, Mathematics and Computer Science
Copyright: © 2017 Joep Bom
More Info
expand_more

Published Date

03-07-2017

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

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.

Files

Report.pdf
(.pdf | 0.418 Mb)