Locally recoverable codes from planar graphs

MaRDI QIDQ5855586zbMATH OpenFDO

Authors Kathryn Haymaker, Justin O'Pella

Publication date 19 March 2021

zbMATH Keywords

availabilityerror-correctionlocal recoveryplanar graphsrate bound

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25) Bounds on codes (94B65)

Recommendations

• Locally recoverable codes on algebraic curves
• Locally recoverable codes from rational maps
• Locally recoverable codes from algebraic curves and surfaces
• Bounds on the size of locally recoverable codes
• Locally repairable codes with high availability based on generalised quadrangles

Cites work

• Fast generation of regular graphs and construction of cages
• Generating all 3‐connected 4‐regular planar graphs from the octahedron graph
• On Planar Graphical Degree Sequences
• On the Locality of Codeword Symbols
• Recursive generation of simple planar 5-regular graphs and pentangulations

Cited in

(6)

• Locally repairable codes with high availability based on generalised quadrangles
• On graphs and codes preserved by edge local complementation
• The independence number of the Birkhoff polytope graph, and applications to maximally recoverable codes
• On finding the largest minimum distance of locally recoverable codes: a graph theory approach
• Group codes over algebra of wreath products
• Enumeration of labeled nonplanar pentacyclic blocks

Describes a project that uses

Uses Software

• GENREG

This page was built for publication: Locally recoverable codes from planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855586)