Locally recoverable codes from planar graphs
Kathryn Haymaker, Justin O'Pella
Source record
Source: Crossref
Published: Jan 15, 2020
DOI: 10.13069/jacodesmath.645021
Open original source ↗Source abstract
In this paper we apply Kadhe and Calderbank's definition of LRCs from convex polyhedra and planar graphs [4] to analyze the codes resulting from 3-connected regular and almost regular planar graphs. The resulting edge codes are locally recoverable with availability two. We prove that the minimum distance of planar graph LRCs is equal to the girth of the graph, and we also establish a new bound on the rate of planar graph edge codes. Constructions of regular and almost regular planar graphs are given, and their associated code parameters are determined. In certain cases, the code families meet the rate bound. Received: 13 June 2019 Accepted: 17 August 2019
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.