{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T07:03:09Z","timestamp":1780038189884,"version":"3.53.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T00:00:00Z","timestamp":1778889600000},"content-version":"vor","delay-in-days":15,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2019R1A6A1A11051177"],"award-info":[{"award-number":["2019R1A6A1A11051177"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s10623-026-01837-7","type":"journal-article","created":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T04:34:17Z","timestamp":1778906057000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ramanujan graphs from simplicial complexes with few blockers"],"prefix":"10.1007","volume":"94","author":[{"given":"Jihye","family":"Jeong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jong Yoon","family":"Hyun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yoonjin","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,16]]},"reference":[{"key":"1837_CR1","doi-asserted-by":"publisher","first-page":"367","DOI":"10.4169\/amer.math.monthly.122.04.367","volume":"122","author":"M Adamaszek","year":"2015","unstructured":"Adamaszek M.: Face numbers of down-sets. Am. Math. Mon. 122, 367\u2013370 (2015).","journal-title":"Am. Math. Mon."},{"key":"1837_CR2","doi-asserted-by":"crossref","unstructured":"Batra R., Saxena N., Shringi D.: Explicit construction of $$Q+1$$ regular local Ramanujan graphs, for all prime-powers $$Q$$. Comput. Complex. 32(1), Paper No. 2, 34 pp. (2023).","DOI":"10.1007\/s00037-023-00235-y"},{"issue":"11","key":"1837_CR3","doi-asserted-by":"publisher","first-page":"6355","DOI":"10.1109\/TIT.2016.2595778","volume":"62","author":"K Bibak","year":"2016","unstructured":"Bibak K., Kapron B.M., Srinivasan V.: The Cayley graphs associated with some quasi-perfect Lee codes are Ramanujan graphs. IEEE Trans. Inform. Theory 62(11), 6355\u20136358 (2016).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"1837_CR4","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1109\/TIT.2016.2517069","volume":"62","author":"C Camarero","year":"2016","unstructured":"Camarero C., Mart\u00ednez C.: Quasi-perfect Lee codes of radius $$2$$ and arbitrarily large dimension. IEEE Trans. Inform. Theory 62(3), 1183\u20131192 (2016).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"10","key":"1837_CR5","doi-asserted-by":"publisher","first-page":"2167","DOI":"10.1007\/s10623-017-0442-5","volume":"86","author":"S Chang","year":"2018","unstructured":"Chang S., Hyun J.Y.: Linear codes from simplicial complexes. Des. Codes Cryptogr. 86(10), 2167\u20132181 (2018).","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"1837_CR6","doi-asserted-by":"publisher","first-page":"3531","DOI":"10.1109\/TIT.2025.3550182","volume":"71","author":"B Chen","year":"2025","unstructured":"Chen B., Xu Y., Hu Z., Li N., Zeng X.: Optimal linear codes with few weights from simplicial complexes. IEEE Trans. Inform. Theory 71(5), 3531\u20133543 (2025).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1837_CR7","volume-title":"Elementary Number Theory, Group Theory, and Ramanujan Graphs","author":"G Davidoff","year":"2003","unstructured":"Davidoff G., Sarnak P., Valette A.: Elementary Number Theory, Group Theory, and Ramanujan Graphs. Cambridge University Press, Cambridge (2003)."},{"key":"1837_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich O., Impagliazzo R., Levin L., Venkatesan R., Zuckerman D.: Security preserving amplification of hardness. In: 31st Annual Symposium on Foundations of Computer Science, vols. I, II, pp. 318\u2013326. IEEE Computer Society Press (1990).","DOI":"10.1109\/FSCS.1990.89550"},{"issue":"4","key":"1837_CR9","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S Hoory","year":"2006","unstructured":"Hoory S., Linial N., Wigderson A.: Expander graphs and their applications. Bull. Amer. Math. Soc. 43(4), 439\u2013561 (2006).","journal-title":"Bull. Amer. Math. Soc."},{"issue":"3","key":"1837_CR10","doi-asserted-by":"publisher","first-page":"1823","DOI":"10.1109\/TIT.2023.3305609","volume":"70","author":"Z Hu","year":"2024","unstructured":"Hu Z., Xu Y., Li N., Zeng X., Wang L., Tang X.: New constructions of optimal linear codes from simplicial complexes. IEEE Trans. Inform. Theory 70(3), 1823\u20131835 (2024).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1837_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)."},{"key":"1837_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.dam.2018.07.007","volume":"254","author":"JY Hyun","year":"2019","unstructured":"Hyun J.Y., Kim H.K., Na M.: Optimal non-projective linear codes constructed from down-sets. Discret. Appl. Math. 254, 135\u2013145 (2019).","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"1837_CR13","doi-asserted-by":"publisher","first-page":"227","DOI":"10.3934\/amc.2020055","volume":"15","author":"JY Hyun","year":"2021","unstructured":"Hyun J.Y., Kim B., Na M.: Construction of minimal linear codes from multi-variable functions. Adv. Math. Commun. 15(2), 227\u2013240 (2021).","journal-title":"Adv. Math. Commun."},{"issue":"11","key":"1837_CR14","doi-asserted-by":"publisher","first-page":"6762","DOI":"10.1109\/TIT.2020.2993179","volume":"66","author":"JY Hyun","year":"2020","unstructured":"Hyun J.Y., Lee J., Lee Y.: Infinite families of optimal linear codes constructed from simplicial complexes. IEEE Trans. Inform. Theory 66(11), 6762\u20136773 (2020).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"1837_CR15","doi-asserted-by":"publisher","first-page":"367","DOI":"10.3934\/amc.2020133","volume":"17","author":"JY Hyun","year":"2023","unstructured":"Hyun J.Y., Lee Y., Wu Y.: Connection of $$p$$-ary $$t$$-weight linear codes to Ramanujan Cayley graphs with $$t+1$$ eigenvalues. Adv. Math. Commun. 17(2), 367\u2013380 (2023).","journal-title":"Adv. Math. Commun."},{"key":"1837_CR16","unstructured":"Janwa H., Moreno O.: Coding-theoretic constructions of some number-theoretic Ramanujan graphs. In: the Twenty-ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing, pp. 63\u201376. Congressus Numerantium, vol. 130 (1998)."},{"issue":"2","key":"1837_CR17","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1090\/S0002-9947-1983-0701524-4","volume":"278","author":"NJ Kalton","year":"1983","unstructured":"Kalton N.J., Roberts J.W.: Uniformly exhaustive submeasures and nearly additive set functions. Trans. Amer. Math. Soc. 278(2), 803\u2013816 (1983).","journal-title":"Trans. Amer. Math. Soc."},{"key":"1837_CR18","unstructured":"Lubotzky A.: Discrete groups, expanding graphs and invariant measures. Birkh\u00e4user Verlag, Mod. Birkh\u00e4user Class (2010)."},{"issue":"1","key":"1837_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1090\/S0273-0979-2011-01359-3","volume":"49","author":"A Lubotzky","year":"2012","unstructured":"Lubotzky A.: Expander graphs in pure and applied mathematics. Bull. Amer. Math. Soc. 49(1), 113\u2013162 (2012).","journal-title":"Bull. Amer. Math. Soc."},{"key":"1837_CR20","doi-asserted-by":"crossref","unstructured":"Lubotzky A., Phillips R., Sarnak P.: Explicit expanders and the Ramanujan conjectures. In: Eighteenth Annual ACM Symposium on Theory of Computing (STOC \u201986), pp. 240\u2013246. Association for Computing Machinery, New York (1986).","DOI":"10.1145\/12130.12154"},{"key":"1837_CR21","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A Lubotzky","year":"1988","unstructured":"Lubotzky A., Phillips R., Sarnak P.: Ramanujan graphs. Combinatorica 8, 261\u2013277 (1988).","journal-title":"Combinatorica"},{"issue":"4","key":"1837_CR22","doi-asserted-by":"publisher","first-page":"3031","DOI":"10.1109\/TIT.2018.2789921","volume":"64","author":"S Mesnager","year":"2018","unstructured":"Mesnager S., Tang C., Qi Y.: $$2$$-correcting Lee codes: (quasi)-perfect spectral conditions and some constructions. IEEE Trans. Inform. Theory 64(4), 3031\u20133041 (2018).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"1837_CR23","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jctb.1994.1054","volume":"62","author":"M Morgenstern","year":"1994","unstructured":"Morgenstern M.: Existence and explicit constructions of $$q+1$$ regular Ramanujan graphs for every prime power $$q$$. J. Combin. Theory Ser. B 62(1), 44\u201362 (1994).","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"1837_CR24","doi-asserted-by":"publisher","first-page":"157","DOI":"10.2307\/3062153","volume":"155","author":"O Reingold","year":"2002","unstructured":"Reingold O., Vadhan S., Wigderson A.: Entropy waves, the zig\u2013zag graph product, and new constant-degree expanders. Ann. Math. 155(1), 157\u2013187 (2002).","journal-title":"Ann. Math."},{"issue":"2","key":"1837_CR25","doi-asserted-by":"publisher","first-page":"425","DOI":"10.3934\/amc.2023044","volume":"18","author":"V Sagar","year":"2024","unstructured":"Sagar V., Sarma R.: Certain binary minimal codes constructed using simplicial complexes. Adv. Math. Commun. 18(2), 425\u2013454 (2024).","journal-title":"Adv. Math. Commun."},{"key":"1837_CR26","doi-asserted-by":"crossref","unstructured":"Shi M., Kiermaier M., Kurz S., Sol\u00e9 P.: Three-weight codes over rings and strongly walk regular graphs. Graphs Combin. 38(3), Paper No. 56, 23 pp (2022).","DOI":"10.1007\/s00373-021-02430-6"},{"issue":"6","key":"1837_CR27","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M Sipser","year":"1996","unstructured":"Sipser M., Spielman D.A.: Expander codes, Codes and complexity. IEEE Trans. Inform. Theory 42(6), 1710\u20131722 (1996).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"1837_CR28","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s00037-017-0155-1","volume":"27","author":"E Viola","year":"2018","unstructured":"Viola E., Wigderson A.: Local expanders. Comput. Complex. 27(2), 225\u2013244 (2018).","journal-title":"Comput. Complex."},{"issue":"6","key":"1837_CR29","doi-asserted-by":"publisher","first-page":"3657","DOI":"10.1109\/TIT.2019.2946840","volume":"66","author":"Y Wu","year":"2020","unstructured":"Wu Y., Zhu X., Yue Q.: Optimal few-weight codes from simplicial complexes. IEEE Trans. Inform. Theory 66(6), 3657\u20133663 (2020).","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01837-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-026-01837-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01837-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T06:20:17Z","timestamp":1780035617000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-026-01837-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["1837"],"URL":"https:\/\/doi.org\/10.1007\/s10623-026-01837-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"3 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"115"}}