Add to ORKGIn 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
Locally repairable codes (LRCs) have gained significant interest for the design of large distributed...
Maximally recoverable codes are codes designed for distributed storage which combine quick recovery ...
AbstractWe prove that the following problems are NP-complete: (1) the existence of a 1-perfect code ...
In this paper we apply Kadhe and Calderbank's definition of LRCs from convex polyhedra and planar gr...
This paper considers the natural extension of locally recoverable codes (LRC) to the case of t > 1 e...
Locally recoverable codes are a class of block codes with an additional property called locality. A ...
Locally recoverable codes are a class of block codes with an additional property called locality. A ...
Recently, locally repairable codes have gained significant interest for their potential applications...
A locally recoverable (LRC) code is a code over a finite eld Fq such that any erased coordinate o...
A code is called a locally recoverable code (LRC) with locality r if any symbol of a codeword can be...
Locally recoverable (LRC) codes have the property that erased coordinates can be recovered by retrie...
A linear error correcting code is a subspace of a finite-dimensional space over a finite field with ...
Locally repairable codes (LRCs) are error correcting codes used in distributed data storage. Besides...
International audienceA code over a finite alphabet is called locally recoverable (LRC code) if ever...
Locally repairable codes (LRCs) with multiple recovering sets are highly demanded in distributed sto...
Locally repairable codes (LRCs) have gained significant interest for the design of large distributed...
Maximally recoverable codes are codes designed for distributed storage which combine quick recovery ...
AbstractWe prove that the following problems are NP-complete: (1) the existence of a 1-perfect code ...
In this paper we apply Kadhe and Calderbank's definition of LRCs from convex polyhedra and planar gr...
This paper considers the natural extension of locally recoverable codes (LRC) to the case of t > 1 e...
Locally recoverable codes are a class of block codes with an additional property called locality. A ...
Locally recoverable codes are a class of block codes with an additional property called locality. A ...
Recently, locally repairable codes have gained significant interest for their potential applications...
A locally recoverable (LRC) code is a code over a finite eld Fq such that any erased coordinate o...
A code is called a locally recoverable code (LRC) with locality r if any symbol of a codeword can be...
Locally recoverable (LRC) codes have the property that erased coordinates can be recovered by retrie...
A linear error correcting code is a subspace of a finite-dimensional space over a finite field with ...
Locally repairable codes (LRCs) are error correcting codes used in distributed data storage. Besides...
International audienceA code over a finite alphabet is called locally recoverable (LRC code) if ever...
Locally repairable codes (LRCs) with multiple recovering sets are highly demanded in distributed sto...
Locally repairable codes (LRCs) have gained significant interest for the design of large distributed...
Maximally recoverable codes are codes designed for distributed storage which combine quick recovery ...
AbstractWe prove that the following problems are NP-complete: (1) the existence of a 1-perfect code ...