{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:09:43Z","timestamp":1771610983404,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,3,25]],"date-time":"2016-03-25T00:00:00Z","timestamp":1458864000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005877","name":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta","doi-asserted-by":"publisher","award":["289002"],"award-info":[{"award-number":["289002"]}],"id":[{"id":"10.13039\/501100005877","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":[[2017,7]]},"DOI":"10.1007\/s10623-016-0194-7","type":"journal-article","created":{"date-parts":[[2016,3,25]],"date-time":"2016-03-25T13:39:40Z","timestamp":1458913180000},"page":"13-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["New lower bounds for the Shannon capacity of odd cycles"],"prefix":"10.1007","volume":"84","author":[{"given":"K. Ashik","family":"Mathew","sequence":"first","affiliation":[]},{"given":"Patric R. J.","family":"\u00d6sterg\u00e5rd","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,25]]},"reference":[{"key":"194_CR1","doi-asserted-by":"crossref","unstructured":"Alon N.: On the capacity of digraphs. Eur. J. Comb. 19, 1\u20135 (1998).","DOI":"10.1006\/eujc.1997.0148"},{"key":"194_CR2","doi-asserted-by":"crossref","unstructured":"Alon N., Orlitsky A.: Repeated communication and Ramsey graphs. IEEE Trans. Inf. Theory 41, 1276\u20131289 (1995).","DOI":"10.1109\/18.412676"},{"key":"194_CR3","doi-asserted-by":"crossref","unstructured":"Ashley J.J., Siegel P.H.: A note on the Shannon capacity of run-length-limited codes. IEEE Trans. Inf. Theory 33, 601\u2013605 (1987).","DOI":"10.1109\/TIT.1987.1057326"},{"key":"194_CR4","unstructured":"Baumert L.D., McEliece R.J., Rodemich E., Rumsey H.C. Jr., Stanley R., Taylor H.: A combinatorial packing problem. In: Birkhoff G., Hall M. Jr. (eds.) Computers in Algebra and Number Theory. Proceedings of Symposium in Applied Mathematics of the AMS and SIAM, New York, 1970, pp. 97\u2013108. American Mathematical Society, Providence (1971)."},{"key":"194_CR5","doi-asserted-by":"crossref","unstructured":"Bohman T.: A limit theorem for the Shannon capacities of odd cycles I. Proc. Am. Math. Soc. 131, 3559\u20133569 (2003).","DOI":"10.1090\/S0002-9939-03-06495-5"},{"key":"194_CR6","doi-asserted-by":"crossref","unstructured":"Bohman T., Holzman R., Natarajan V.: On the independence numbers of the cubes of odd cycles. Electron. J. Comb. 20(3), P10 (2013).","DOI":"10.37236\/2598"},{"key":"194_CR7","doi-asserted-by":"crossref","unstructured":"Bomze I.M., Budinich M., Pardalos P.M., Pelillo M.: The maximum clique problem. In: Du D.Z., Pardalos P.M. (eds.) Handbook of Combinatorial Optimization, Supplement, vol. A, pp. 1\u201374. Kluwer, Dordrecht (1999).","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"194_CR8","unstructured":"Braun M., \u00d6sterg\u00e5rd P.R.J., Wassermann A.: New lower bounds for binary constant dimension subspace codes. Submitted for publication."},{"key":"194_CR9","unstructured":"Brouwer A.E., Schrijver A.: Uniform hypergraphs. In: Schrijver A. (ed.) Packing and Covering in Combinatorics. Mathematical Centre Tracts No. 106, pp. 39\u201373. Mathematisch Centrum, Amsterdam (1979)."},{"key":"194_CR10","unstructured":"Feige U.: Randomized graph products, chromatic numbers, and the Lov\u00e1sz $$\\vartheta $$ \u03d1 -function, In: Proceedings of 27th Annual ACM Symposium on the Theory of Computing, pp. 635\u2013640. ACM, New York (1995)."},{"key":"194_CR11","doi-asserted-by":"crossref","unstructured":"Frucht R.: On the groups of repeated graphs. Bull. Am. Math. Soc. 55, 418\u2013420 (1949).","DOI":"10.1090\/S0002-9904-1949-09230-3"},{"key":"194_CR12","unstructured":"Haemers W.: An upper bound for the Shannon capacity of a graph. In: Lov\u00e1sz L., S\u00f3s V.T. (eds.) Algebraic Methods in Graph Theory. Colloquia Mathematica Societatis J\u00e1nos Bolyai, vol. 25, pp. 267\u2013272. Szeged (1978)."},{"key":"194_CR13","doi-asserted-by":"crossref","unstructured":"Haemers W.: On some problems of Lov\u00e1sz concerning the Shannon capacity of a graph. IEEE Trans. Inf. Theory 25, 231\u2013232 (1979).","DOI":"10.1109\/TIT.1979.1056027"},{"key":"194_CR14","doi-asserted-by":"crossref","unstructured":"Hammack R., Imrich W., Klav\u017ear S.: Handbook of Product Graphs, 2nd edn. CRC, Boca Raton (2011).","DOI":"10.1201\/b10959"},{"key":"194_CR15","unstructured":"Kaski P., \u00d6sterg\u00e5rd P.R.J.: Classification Algorithms for Codes and Designs. Springer, Berlin (2006)."},{"key":"194_CR16","unstructured":"Keller O.H.: \u00dcber die l\u00fcckenlose Erf\u00fcllung des Raumes mit W\u00fcrfeln. J. Reine Angew. Math. 163, 231\u2013248 (1930)."},{"key":"194_CR17","doi-asserted-by":"crossref","unstructured":"Knuth D.E.: The sandwich theorem. Electron. J. Comb. 1, A1 (1994).","DOI":"10.37236\/1193"},{"key":"194_CR18","doi-asserted-by":"crossref","unstructured":"K\u00f6rner J., Orlitsky A.: Zero-error information theory. IEEE Trans. Inf. Theory 44, 2207\u20132229 (1998).","DOI":"10.1109\/18.720537"},{"key":"194_CR19","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz L.: On the Shannon capacity of a graph. IEEE Trans. Inf. Theory 25, 1\u20137 (1979).","DOI":"10.1109\/TIT.1979.1055985"},{"key":"194_CR20","doi-asserted-by":"crossref","unstructured":"Mathew K.A., \u00d6sterg\u00e5rd P.R.J., Popa A.: On the Shannon capacity of triangular graphs. Electron. J. Comb. 20(2), P27 (2013).","DOI":"10.37236\/3214"},{"key":"194_CR21","doi-asserted-by":"crossref","unstructured":"Montemanni R., Smith D.H.: Heuristic algorithms for constructing binary constant weight codes. IEEE Trans. Inf. Theory 55, 4651\u20134656 (2009).","DOI":"10.1109\/TIT.2009.2027491"},{"key":"194_CR22","unstructured":"Niskanen S., \u00d6sterg\u00e5rd P.R.J.: Cliquer User\u2019s Guide (Version 1.0). Technical Report T48, Communications Laboratory, Helsinki University of Technology, Espoo (2003)."},{"key":"194_CR23","doi-asserted-by":"crossref","unstructured":"Shannon C.E.: The zero-error capacity of a noisy channel. IRE Trans. Inf. Theory 2, 8\u201319 (1956).","DOI":"10.1109\/TIT.1956.1056798"},{"key":"194_CR24","doi-asserted-by":"crossref","unstructured":"Szegedy M.: A note on the $$\\Theta $$ \u0398 number of Lov\u00e1sz and the generalized Delsarte bound. In: Proceedings of 35th Annual Symposium on Foundations of Computer Science, pp. 36\u201341. IEEE Computer Society, Los Alamitos (1994).","DOI":"10.1109\/SFCS.1994.365707"},{"key":"194_CR25","doi-asserted-by":"crossref","unstructured":"Vesel A., \u017derovnik J.: Improved lower bound on the Shannon capacity of $$C_7$$ C 7 . Inf. Process. Lett. 81, 277\u2013282 (2002).","DOI":"10.1016\/S0020-0190(01)00229-0"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0194-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0194-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0194-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0194-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T20:00:22Z","timestamp":1600372822000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0194-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,25]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["194"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0194-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,25]]}}}