On Coset Leader Graphs of Structured Linear Codes

Eran Iceland*, Alex Samorodnitsky

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


We suggest a new approach to obtain bounds on locally correctable and some locally testable binary linear codes, by arguing that these codes (or their subcodes) have coset leader graphs with high discrete Ricci curvature. The bounds we obtain for locally correctable codes are worse than the best known bounds obtained using quantum information theory, but are better than those obtained using other methods, such as the “usual” information theory. (We remark that our methods are completely elementary.) The bounds we obtain for a family of locally testable codes improve the best known bounds.

Original languageAmerican English
Pages (from-to)560-576
Number of pages17
JournalDiscrete and Computational Geometry
Issue number3
StatePublished - 1 Apr 2020

Bibliographical note

Publisher Copyright:
© 2019, Springer Science+Business Media, LLC, part of Springer Nature.


  • Discrete curvature
  • Linear codes
  • Locally correctable codes


Dive into the research topics of 'On Coset Leader Graphs of Structured Linear Codes'. Together they form a unique fingerprint.

Cite this