{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T20:29:19Z","timestamp":1776284959918,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T00:00:00Z","timestamp":1567468800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T00:00:00Z","timestamp":1567468800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1241\/11"],"award-info":[{"award-number":["1241\/11"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1724\/15"],"award-info":[{"award-number":["1724\/15"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006221","name":"United States - Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2010451"],"award-info":[{"award-number":["2010451"]}],"id":[{"id":"10.13039\/100006221","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s00454-019-00129-3","type":"journal-article","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T18:41:47Z","timestamp":1567536107000},"page":"560-576","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Coset Leader Graphs of Structured Linear Codes"],"prefix":"10.1007","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2126-3526","authenticated-orcid":false,"given":"Eran","family":"Iceland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Samorodnitsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,3]]},"reference":[{"issue":"6","key":"129_CR1","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.4310\/MRL.2012.v19.n6.a2","volume":"19","author":"F Bauer","year":"2012","unstructured":"Bauer, F., Jost, J., Liu, S.: Ollivier\u2013Ricci curvature and the spectrum of the normalized graph Laplace operator. Math. Res. Lett. 19(6), 1185\u20131205 (2012)","journal-title":"Math. Res. Lett."},{"issue":"3","key":"129_CR2","doi-asserted-by":"publisher","first-page":"359","DOI":"10.4310\/jdg\/1424880980","volume":"99","author":"F Bauer","year":"2015","unstructured":"Bauer, F., Horn, P., Lin, Y., Lippner, G., Mangoubi, D., Yau, S.-T.: Li\u2013Yau inequality on graphs. J. Differ. Geom. 99(3), 359\u2013405 (2015)","journal-title":"J. Differ. Geom."},{"issue":"2","key":"129_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s00037-012-0042-8","volume":"21","author":"E Ben-Sasson","year":"2012","unstructured":"Ben-Sasson, E., Viderman, M.: Towards lower bounds on locally testable codes via density arguments. Comput. Complexity 21(2), 267\u2013309 (2012)","journal-title":"Comput. Complexity"},{"key":"129_CR4","doi-asserted-by":"crossref","unstructured":"Charney, R.: Metric geometry: connections with combinatorics. In: Billera, L.J., Greene, C., Simion, R., Stanley, R.P. (eds.) Formal Power Series and Algebraic Combinatorics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 24, pp. 55\u201369. American Mathematical Society, Providence (1996)","DOI":"10.1090\/dimacs\/024\/03"},{"key":"129_CR5","series-title":"North-Holland Mathematical Library","volume-title":"Covering Codes","author":"G Cohen","year":"1997","unstructured":"Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering Codes. North-Holland Mathematical Library, vol. 54. North-Holland Publishing, Amsterdam (1997)"},{"key":"129_CR6","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-22935-0_43","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Irit Dinur","year":"2011","unstructured":"Dinur, I., Kaufman, T.: Dense locally testable codes cannot have constant rate and distance. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) Approximation, Randomization, and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 6845, pp. 507\u2013518. Springer, Heidelberg (2011)"},{"key":"129_CR7","doi-asserted-by":"crossref","unstructured":"Dvir, Z., Saraf, S., Wigderson, A.: Breaking the quadratic barrier for 3-LCC\u2019s over the reals. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp. 784\u2013793. ACM, New York (2014)","DOI":"10.1145\/2591796.2591818"},{"issue":"3","key":"129_CR8","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/S0895480102408353","volume":"19","author":"J Friedman","year":"2005","unstructured":"Friedman, J., Tillich, J.-P.: Generalized Alon\u2013Boppana theorems and error-correcting codes. SIAM J. Discrete Math. 19(3), 700\u2013718 (2005)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"129_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00037-006-0216-3","volume":"15","author":"O Goldreich","year":"2006","unstructured":"Goldreich, O., Karloff, H., Schulman, L.J., Trevisan, L.: Lower bounds for linear locally decodable codes and private information retrieval. Comput. Complexity 15(3), 263\u2013296 (2006)","journal-title":"Comput. Complexity"},{"key":"129_CR10","doi-asserted-by":"crossref","unstructured":"Katz, J., Trevisan, L.: On the efficiency of local decoding procedures for error-correcting codes. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 80\u201386. ACM, New York (2000)","DOI":"10.1145\/335305.335315"},{"key":"129_CR11","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/978-3-642-15369-3_50","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Tali Kaufman","year":"2010","unstructured":"Kaufman, T., Viderman, M.: Locally testable vs. locally decodable codes. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) Approximation, Randomization, and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 6302, pp. 670\u2013682. Springer, Berlin (2010)"},{"issue":"3","key":"129_CR12","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.jcss.2004.04.007","volume":"69","author":"I Kerenidis","year":"2004","unstructured":"Kerenidis, I., de Wolf, R.: Exponential lower bound for 2-query locally decodable codes via a quantum argument. J. Comput. Syst. Sci. 69(3), 395\u2013420 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"129_CR13","unstructured":"Klartag, B., Kozma, G., Ralli, P., Tetali, P.: Discrete curvature and abelian groups (2015). arXiv:1501.00516"},{"key":"129_CR14","volume-title":"Markov Chains and Mixing Times","author":"DA Levin","year":"2009","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. American Mathematical Society, Providence (2009). With a chapter by James G. Propp and David B. Wilson"},{"issue":"2","key":"129_CR15","doi-asserted-by":"publisher","first-page":"343","DOI":"10.4310\/MRL.2010.v17.n2.a13","volume":"17","author":"Y Lin","year":"2010","unstructured":"Lin, Y., Yau, S.-T.: Ricci curvature and eigenvalue estimate on locally finite graphs. Math. Res. Lett. 17(2), 343\u2013356 (2010)","journal-title":"Math. Res. Lett."},{"key":"129_CR16","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland Mathematical Library, vol. 16. North-Holland Publishing, Amsterdam (1977)"},{"issue":"3","key":"129_CR17","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1016\/j.jfa.2008.11.001","volume":"256","author":"Y Ollivier","year":"2009","unstructured":"Ollivier, Y.: Ricci curvature of Markov chains on metric spaces. J. Funct. Anal. 256(3), 810\u2013864 (2009)","journal-title":"J. Funct. Anal."},{"issue":"3","key":"129_CR18","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1137\/11085966X","volume":"26","author":"Y Ollivier","year":"2012","unstructured":"Ollivier, Y., Villani, C.: A curved Brunn\u2013Minkowski inequality on the discrete hypercube, or: what is the Ricci curvature of the discrete hypercube? SIAM J. Discrete Math. 26(3), 983\u2013996 (2012)","journal-title":"SIAM J. Discrete Math."},{"key":"129_CR19","first-page":"53","volume":"4","author":"A Petrunin","year":"2011","unstructured":"Petrunin, A.: Alexandrov meets Lott\u2013Villani\u2013Sturm. M\u00fcnster J. Math. 4, 53\u201364 (2011)","journal-title":"M\u00fcnster J. Math."},{"key":"129_CR20","doi-asserted-by":"crossref","unstructured":"van Lint, J.H.: Introduction to Coding Theory. Graduate Texts in Mathematics, vol.\u00a086, 3rd edn. Springer, Berlin (1999)","DOI":"10.1007\/978-3-642-58575-3"},{"key":"129_CR21","unstructured":"Woodruff, D.: New lower bounds for general locally decodable codes. In: Electronic Colloquium on Computational Complexity (ECCC), vol.\u00a014 (2007)"},{"issue":"4","key":"129_CR22","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1007\/s11390-012-1254-8","volume":"27","author":"DP Woodruff","year":"2012","unstructured":"Woodruff, D.P.: A quadratic lower bound for three-query linear locally decodable codes over any field. J. Comput. Sci. Technol. 27(4), 678\u2013686 (2012)","journal-title":"J. Comput. Sci. Technol."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-019-00129-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-019-00129-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-019-00129-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T23:13:53Z","timestamp":1599002033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-019-00129-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,3]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["129"],"URL":"https:\/\/doi.org\/10.1007\/s00454-019-00129-3","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,3]]},"assertion":[{"value":"4 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}