A master thesis from Aalborg University
Locally Recoverable Codes
[Locally Recoverable Codes: Construction and Properties of Locally Recoverable Codes]
Author(s)
Term
4. term
Education
Publication year
2023
Submitted on
2023-05-29
Pages
46 pages
Abstract
This paper analyzes and constructs Locally recoverable codes. The paper initially defines Reed Solomon codes and redundant residue codes and shows the limitations of this particular encoding. The paper then defines locality and constructs Reed Solomon-like locally recoverable codes. Related to this construction is the concept of a nice polynomial and the paper provides several ways of constructing nice polynomials. The paper shows several extensions of the initial construction of locally recoverable codes. Furthermore, the paper also describes how locally recoverable can be constructed by combining several Reed Solomon codes. The paper also proves a singleton-like bound on the minimum distance and shows that almost all the locally recoverable codes constructed in this paper meet this bound with equality. Lastly, the paper defines cyclic locally recoverable codes and describes their subfield subcodes, and shows several results concerning the size of recovering sets for subfield subcodes.
Keywords
Documents
Colophon: This page is part of the AAU Student Projects portal, which is run by Aalborg University. Here, you can find and download publicly available bachelor's theses and master's projects from across the university dating from 2008 onwards. Student projects from before 2008 are available in printed form at Aalborg University Library.
If you have any questions about AAU Student Projects or the research registration, dissemination and analysis at Aalborg University, please feel free to contact the VBN team. You can also find more information in the AAU Student Projects FAQs.