No article text was recorded for this version.
graph-based code construction
Version 1 of 127 papers44 conceptsfrozen 2026-10-04
Papers in this version
- Blog: c <sup>3</sup> -Locally Testable Codes from Lossless Expanders
- Blog: Cooperative local repair in distributed storage
- Blog: Cooperative local repair in distributed storage.
- Blog: Bounds on the Parameters of Locally Recoverable Codes
- Blog: Batch Codes Through Dense Graphs Without Short Cycles.
- Blog: A tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures
- Blog: Fractional repetition codes for repair in distributed storage systems
- Blog: On the Optimal Minimum Distance of Fractional Repetition Codes
- Blog: A repair framework for scalar MDS codes
- Blog: Replication based storage systems with local repair
- Blog: Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy.
- Blog: Repairable Fountain Codes
- Blog: Bounds and constructions of codes with all-symbol locality and availability
- Blog: SHO-FA: Robust Compressive Sensing With Order-Optimal Complexity, Measurements, and Bits
- Blog: Efficient Document Exchange and Error Correcting Codes with Asymmetric Information
- Blog: Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels.
- Blog: Associative Memory Using Dictionary Learning and Expander Decoding
- Blog: For-All Sparse Recovery in Near-Optimal Time
- Blog: Lower bounds for 2-query LCCs over large alphabet
- Blog: A Repair Framework for Scalar MDS Codes.
- Blog: Constructing LDPC Codes by 2-Lifts
- Blog: On Generalized LDPC Codes for 5G Ultra Reliable Communication
- Blog: Bounding multiple unicasts through index coding and Locally Repairable Codes.
- Blog: For-all Sparse Recovery in Near-Optimal Time
- Blog: On the Number of Errors Correctable with Codes on Graphs
- Blog: Upper and lower bounds on the minimum distance of expander codes
- Blog: On secure distributed data storage under repair dynamics
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_graph_based_code_construction_ddfc81cf,
title = {graph-based code construction},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/graph-based-code-construction/rdr_ddfc81cf5d9c42029e3e4d8c395a54d4},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 1, frozen text):
@misc{lacuna_graph_based_code_construction_ddfc81cf_v1,
title = {graph-based code construction},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/graph-based-code-construction/rdr_ddfc81cf5d9c42029e3e4d8c395a54d4/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}