{"id":{"repo_id":"usf","oai_identifier":"oai:digitalcommons.usf.edu:etd-11790"},"canonical_url":"https://search.ndltd.org/etd/usf/oai:digitalcommons.usf.edu:etd-11790","repository":{"repo_id":"usf","name":"University of South Florida","base_url":"https://digitalcommons.usf.edu/do/oai/"},"display":{"title":"Optimal Selection of Good Polynomials and Constructions of Locally Recoverable Codes via Galois Theory","abstract":"To keep up with the ever-growing demand for reliable and efficient availability of data,locally recoverable codes (LRCs) have been the focus of much study due to their applications in cloud and distributed storage systems. A fundamental construction of LRCs was given in [36] based on polynomials which relied on the existence of r-good polynomials. In the same paper some constructions of good polynomials were given, but these constructions did not cover every configuration of parameters. Naturally this led to research into constructing good polynomials for what was not addressed in [36], but new ponderings were also posed, such as the following: for a locally recoverable code with fixed parameters, are some good polynomials better than others? In [29], Micheli approached this topic using machinery from Galois theory and defined more generally (r, ℓ)-good polynomials and showed that maximizing ℓ (for a given locality r) yields a code with higher dimension. In this dissertation, we determine the optimum value of ℓ for any (r, ℓ)-good polynomials of degree up to 5. We then provide an explicit construction of a newer class of LRCs called hierarchical locally recoverable codes (HLRCs) and prove that our construction yields codes with higher dimension than existing literature in some regimes of parameters. This dissertation is intended to be self-contained. As a result, the first few chapters address the fundamental background in coding theory, algebraic number theory, etc., needed to understand the aforementioned results.","abstract_html":"To keep up with the ever-growing demand for reliable and efficient availability of data,locally recoverable codes (LRCs) have been the focus of much study due to their applications in cloud and distributed storage systems. A fundamental construction of LRCs was given in [36] based on polynomials which relied on the existence of r-good polynomials. In the same paper some constructions of good polynomials were given, but these constructions did not cover every configuration of parameters. Naturally this led to research into constructing good polynomials for what was not addressed in [36], but new ponderings were also posed, such as the following: for a locally recoverable code with fixed parameters, are some good polynomials better than others? In [29], Micheli approached this topic using machinery from Galois theory and defined more generally (r, ℓ)-good polynomials and showed that maximizing ℓ (for a given locality r) yields a code with higher dimension. In this dissertation, we determine the optimum value of ℓ for any (r, ℓ)-good polynomials of degree up to 5. We then provide an explicit construction of a newer class of LRCs called hierarchical locally recoverable codes (HLRCs) and prove that our construction yields codes with higher dimension than existing literature in some regimes of parameters. This dissertation is intended to be self-contained. As a result, the first few chapters address the fundamental background in coding theory, algebraic number theory, etc., needed to understand the aforementioned results.","abstract_has_math":false,"creators":["Dukes, Austin"],"institution":"University of South Florida","degree_name":"Doctor of Philosophy (Ph.D.)","degree_level":"Dissertation","degree_discipline":"Mathematics and Statistics","degree_department":null,"school":null,"contributors":["Giacomo Micheli, Ph.D.","Lukas Kölsch, Ph.D.","Jean-François Biasse, Ph.D.","Xiang-dong Hou, Ph.D.","Joachim Rosenthal, Ph.D."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2024,"date_issued":"2024-06-21T07:00:00Z","date_published":"2024-06-21T07:00:00Z","updated_at":"2026-11-19T08:49:56Z","subjects":["chebotarev density theorem","good polynomials","hierarchical locally recoverable codes","locally recoverable codes","Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usf.edu/etd/10503","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usf.edu/etd/10503","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usf.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usf.edu%3Aetd-11790","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Giacomo Micheli, Ph.D.","Lukas Kölsch, Ph.D.","Jean-François Biasse, Ph.D.","Xiang-dong Hou, Ph.D.","Joachim Rosenthal, Ph.D."]},{"key":"dc:creator","label":"Author","values":["Dukes, Austin"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2024-06-21T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics and Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation","Ph.D."]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy (Ph.D.)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of South Florida"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["chebotarev density theorem","good polynomials","hierarchical locally recoverable codes","locally recoverable codes","Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usf.edu/etd/10503"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["To keep up with the ever-growing demand for reliable and efficient availability of data,locally recoverable codes (LRCs) have been the focus of much study due to their applications in cloud and distributed storage systems. A fundamental construction of LRCs was given in [36] based on polynomials which relied on the existence of r-good polynomials. In the same paper some constructions of good polynomials were given, but these constructions did not cover every configuration of parameters. Naturally this led to research into constructing good polynomials for what was not addressed in [36], but new ponderings were also posed, such as the following: for a locally recoverable code with fixed parameters, are some good polynomials better than others? In [29], Micheli approached this topic using machinery from Galois theory and defined more generally (r, ℓ)-good polynomials and showed that maximizing ℓ (for a given locality r) yields a code with higher dimension. In this dissertation, we determine the optimum value of ℓ for any (r, ℓ)-good polynomials of degree up to 5. We then provide an explicit construction of a newer class of LRCs called hierarchical locally recoverable codes (HLRCs) and prove that our construction yields codes with higher dimension than existing literature in some regimes of parameters. This dissertation is intended to be self-contained. As a result, the first few chapters address the fundamental background in coding theory, algebraic number theory, etc., needed to understand the aforementioned results."]},{"key":"dc:title","label":"Title","values":["Optimal Selection of Good Polynomials and Constructions of Locally Recoverable Codes via Galois Theory"]}]}],"canonical_facts":{"dc:contributor":["Giacomo Micheli, Ph.D.","Lukas Kölsch, Ph.D.","Jean-François Biasse, Ph.D.","Xiang-dong Hou, Ph.D.","Joachim Rosenthal, Ph.D."],"dc:creator":["Dukes, Austin"],"dc:date":["2024-06-21T07:00:00Z"],"dc:description":["To keep up with the ever-growing demand for reliable and efficient availability of data,locally recoverable codes (LRCs) have been the focus of much study due to their applications in cloud and distributed storage systems. A fundamental construction of LRCs was given in [36] based on polynomials which relied on the existence of r-good polynomials. In the same paper some constructions of good polynomials were given, but these constructions did not cover every configuration of parameters. Naturally this led to research into constructing good polynomials for what was not addressed in [36], but new ponderings were also posed, such as the following: for a locally recoverable code with fixed parameters, are some good polynomials better than others? In [29], Micheli approached this topic using machinery from Galois theory and defined more generally (r, ℓ)-good polynomials and showed that maximizing ℓ (for a given locality r) yields a code with higher dimension. In this dissertation, we determine the optimum value of ℓ for any (r, ℓ)-good polynomials of degree up to 5. We then provide an explicit construction of a newer class of LRCs called hierarchical locally recoverable codes (HLRCs) and prove that our construction yields codes with higher dimension than existing literature in some regimes of parameters. This dissertation is intended to be self-contained. As a result, the first few chapters address the fundamental background in coding theory, algebraic number theory, etc., needed to understand the aforementioned results."],"dc:identifier":["https://digitalcommons.usf.edu/etd/10503"],"dc:subject":["chebotarev density theorem","good polynomials","hierarchical locally recoverable codes","locally recoverable codes","Mathematics"],"dc:title":["Optimal Selection of Good Polynomials and Constructions of Locally Recoverable Codes via Galois Theory"],"thesis:degree_discipline":["Mathematics and Statistics"],"thesis:degree_level":["Dissertation","Ph.D."],"thesis:degree_name":["Doctor of Philosophy (Ph.D.)"],"thesis:institution_name":["University of South Florida"]},"updated_at":"2026-11-19T08:49:56Z"}