Error-correcting graph codes

DOI10.4230/LIPICS.ITCS.2025.67MaRDI QIDQ7296713zbMATH OpenFDO

Authors Swastik Kopparty, Aditya Potukuchi, Harry Sha

Publication date 14 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2025.67

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
• Analyzing graphs with node differential privacy
• Class of constructive asymptotically good algebraic codes
• Codes for Graph Erasures
• Double and Triple Node-Erasure-Correcting Codes Over Complete Graphs
• On codes derivable from the tensor product of check matrices
• Polynomial Codes Over Certain Finite Fields
• Structured Codes of Graphs
• Symmetric bilinear forms over finite fields with applications to coding theory
• Threshold decoding

This page was built for publication: Error-correcting graph codes

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