{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:32:37Z","timestamp":1761294757154,"version":"3.28.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T00:00:00Z","timestamp":1721692800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T00:00:00Z","timestamp":1721692800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s00493-024-00114-2","type":"journal-article","created":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T12:19:01Z","timestamp":1721737141000},"page":"1193-1209","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Storage Codes on Coset Graphs with Asymptotically Unit Rate"],"prefix":"10.1007","volume":"44","author":[{"given":"Alexander","family":"Barg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Schwartz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lev","family":"Yohananov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,23]]},"reference":[{"key":"114_CR1","doi-asserted-by":"publisher","unstructured":"Alon, N., Lubetzky, E., Stav, U., Weinstein, A., Hassidim, A.: Broadcasting with side information. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 823\u2013832 (2008). https:\/\/doi.org\/10.1109\/FOCS.2008.41","DOI":"10.1109\/FOCS.2008.41"},{"issue":"3\u20134","key":"114_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1561\/0100000094","volume":"14","author":"F Arbabjolfaei","year":"2018","unstructured":"Arbabjolfaei, F., Kim, Y.-H.: Fundamentals of index coding. Found. Trends Commun. Inf. Theory 14(3\u20134), 163\u2013346 (2018). https:\/\/doi.org\/10.1561\/0100000094","journal-title":"Found. Trends Commun. Inf. Theory"},{"issue":"3","key":"114_CR3","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1109\/TIT.2010.2103753","volume":"57","author":"Z Bar-Yossef","year":"2011","unstructured":"Bar-Yossef, Z., Birk, Y., Jayram, T.S., Kol, T.: Index coding with side information. IEEE Trans. Inform. Theory 57(3), 1479\u20131494 (2011). https:\/\/doi.org\/10.1109\/TIT.2010.2103753","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"114_CR4","doi-asserted-by":"publisher","first-page":"7787","DOI":"10.1109\/TIT.2022.3191309","volume":"68","author":"A Barg","year":"2022","unstructured":"Barg, A., Z\u00e9mor, G.: High-rate storage codes on triangle-free graphs. IEEE Trans. Inform. Theory 68(12), 7787\u20137797 (2022). https:\/\/doi.org\/10.1109\/TIT.2022.3191309","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"114_CR5","doi-asserted-by":"publisher","first-page":"48","DOI":"10.37236\/4731","volume":"23","author":"PJ Cameron","year":"2016","unstructured":"Cameron, P.J., Dang, A.N., Riis, S.: Guessing games on triangle-free graphs. Electron. J. Combin. 23(1), 48 (2016). https:\/\/doi.org\/10.37236\/4731","journal-title":"Electron. J. Combin."},{"issue":"1","key":"114_CR6","doi-asserted-by":"publisher","first-page":"192","DOI":"10.37236\/679","volume":"18","author":"D Christofides","year":"2011","unstructured":"Christofides, D., Markstr\u00f6m, K.: The guessing number of undirected graphs. Electron. J. Combin. 18(1), 192 (2011). https:\/\/doi.org\/10.37236\/679","journal-title":"Electron. J. Combin."},{"issue":"1","key":"114_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0304-3975(99)00185-1","volume":"235","author":"B Codenotti","year":"2000","unstructured":"Codenotti, B., Pudl\u00e1k, P., Resta, G.: Some structural properties of low-rank matrices related to computational complexity. Theor. Comput. Sci. 235(1), 89\u2013107 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(99)00185-1","journal-title":"Theor. Comput. Sci."},{"issue":"9","key":"114_CR8","doi-asserted-by":"publisher","first-page":"6087","DOI":"10.1109\/TIT.2013.2261116","volume":"59","author":"A Couvreur","year":"2013","unstructured":"Couvreur, A., Delfosse, N., Z\u00e9mor, G.: A construction of quantum LDPC codes from Cayley graphs. IEEE Trans. Inform. Theory 59(9), 6087\u20136098 (2013). https:\/\/doi.org\/10.1109\/TIT.2013.2261116","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"10","key":"114_CR9","doi-asserted-by":"publisher","first-page":"6703","DOI":"10.1109\/TIT.2011.2155618","volume":"57","author":"M Gadouleau","year":"2011","unstructured":"Gadouleau, M., Riis, S.: Graph-theoretical constructions for graph entropy and network coding based communications. IEEE Trans. Inform. Theory 57(10), 6703\u20136717 (2011). https:\/\/doi.org\/10.1109\/TIT.2011.2155618","journal-title":"IEEE Trans. Inform. Theory"},{"key":"114_CR10","doi-asserted-by":"publisher","unstructured":"Golovnev, A., Haviv, I.: The (generalized) orthogonality dimension of (generalized) Kneser graphs: bounds and applications. In: 36th Computational Complexity Conference. Leibniz International Proceedings in Informatics, vol. 200, pp. 8.1\u20138.15. Schloss Dagstuhl \u2013 Leibniz Center for Informatics, Wadern (2021) https:\/\/doi.org\/10.4230\/LIPIcs.CCC.2021.8","DOI":"10.4230\/LIPIcs.CCC.2021.8"},{"issue":"11","key":"114_CR11","doi-asserted-by":"publisher","first-page":"6990","DOI":"10.1109\/TIT.2018.2810384","volume":"64","author":"A Golovnev","year":"2018","unstructured":"Golovnev, A., Regev, O., Weinstein, O.: The Minrank of random graphs. IEEE Trans. Inform. Theory 64(11), 6990\u20136995 (2018). https:\/\/doi.org\/10.1109\/TIT.2018.2810384","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"114_CR12","doi-asserted-by":"publisher","first-page":"6925","DOI":"10.1109\/TIT.2012.2208937","volume":"58","author":"P Gopalan","year":"2011","unstructured":"Gopalan, P., Huang, C., Simitci, H., Yekhanin, S.: On the locality of codeword symbols. IEEE Trans. Inform. Theory 58(11), 6925\u20136934 (2011). https:\/\/doi.org\/10.1109\/TIT.2012.2208937","journal-title":"IEEE Trans. Inform. Theory"},{"key":"114_CR13","unstructured":"Haemers, W.H.: An upper bound for the Shannon capacity of a graph. In: Lov\u00e1sz, L., S\u00f3s, V. (eds.) Algebraic Methods in Graph Theory, Szeged, 1978. Colloquia Mathematica Societatis J\u00e1nos Bolyai, vol. 25, pp. 267\u2013272. North-Holland, Amsterdam (1981). https:\/\/research.tilburguniversity.edu\/en\/publications\/"},{"key":"114_CR14","doi-asserted-by":"publisher","unstructured":"Haviv, I.: On Minrank and forbidden subgraphs. ACM Trans. Comput. Theory 11(4), Art. 20 (2019). https:\/\/doi.org\/10.1145\/3322817","DOI":"10.1145\/3322817"},{"issue":"12","key":"114_CR15","doi-asserted-by":"publisher","first-page":"3901","DOI":"10.1007\/s10623-023-01278-6","volume":"91","author":"H Huang","year":"2023","unstructured":"Huang, H., Xiang, Q.: Construction of storage codes of rate approaching one on triangle-free graphs. Des. Codes Cryptogr. 91(12), 3901\u20133913 (2023). https:\/\/doi.org\/10.1007\/s10623-023-01278-6","journal-title":"Des. Codes Cryptogr."},{"issue":"8","key":"114_CR16","doi-asserted-by":"publisher","first-page":"3544","DOI":"10.1109\/TIT.2009.2023702","volume":"55","author":"E Lubetzky","year":"2009","unstructured":"Lubetzky, E., Stav, U.: Nonlinear index coding outperforming the linear optimum. IEEE Trans. Inform. Theory 55(8), 3544\u20133551 (2009). https:\/\/doi.org\/10.1109\/TIT.2009.2023702","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"114_CR17","doi-asserted-by":"publisher","first-page":"5810","DOI":"10.1109\/TIT.2015.2472521","volume":"61","author":"A Mazumdar","year":"2015","unstructured":"Mazumdar, A.: Storage capacity of repairable networks. IEEE Trans. Inform. Theory 61(11), 5810\u20135821 (2015). https:\/\/doi.org\/10.1109\/TIT.2015.2472521","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"114_CR18","doi-asserted-by":"publisher","first-page":"5580","DOI":"10.1109\/TIT.2019.2910026","volume":"65","author":"A Mazumdar","year":"2019","unstructured":"Mazumdar, A., McGregor, A., Vorotnikova, S.: Storage capacity as an information-theoretic vertex cover and the index coding rate. IEEE Trans. Inform. Theory 65(9), 5580\u20135591 (2019). https:\/\/doi.org\/10.1109\/TIT.2019.2910026","journal-title":"IEEE Trans. Inform. Theory"},{"key":"114_CR19","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1561\/0100000115","volume":"19","author":"V Ramkumar","year":"2022","unstructured":"Ramkumar, V., Balaji, S.B., Sasidharan, B., Vajha, M., Krishnan, M.N., Kumar, P.V.: Codes for distributed storage. Found. Trends Commun. Inform. Theory 19, 547\u2013813 (2022). https:\/\/doi.org\/10.1561\/0100000115","journal-title":"Found. Trends Commun. Inform. Theory"},{"key":"114_CR20","doi-asserted-by":"publisher","unstructured":"Riis, S.: Information flows, graphs and their guessing numbers. Electron. J. Combin. 14, Research paper 44 (2007). https:\/\/doi.org\/10.37236\/962","DOI":"10.37236\/962"},{"key":"114_CR21","doi-asserted-by":"publisher","unstructured":"Shanmugam, K., Dimakis, A.G.: Bounding multiple unicasts through index coding and locally repairable codes. In: 2014 IEEE International Symposium on Information Theory, pp. 296\u2013300 (2014). https:\/\/doi.org\/10.1109\/ISIT.2014.6874842","DOI":"10.1109\/ISIT.2014.6874842"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00114-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-024-00114-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00114-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T14:03:39Z","timestamp":1731679419000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-024-00114-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,23]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["114"],"URL":"https:\/\/doi.org\/10.1007\/s00493-024-00114-2","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"type":"print","value":"0209-9683"},{"type":"electronic","value":"1439-6912"}],"subject":[],"published":{"date-parts":[[2024,7,23]]},"assertion":[{"value":"22 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}