{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:11Z","timestamp":1772283671140,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2009,5,19]],"date-time":"2009-05-19T00:00:00Z","timestamp":1242691200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s00607-009-0039-6","type":"journal-article","created":{"date-parts":[[2009,5,18]],"date-time":"2009-05-18T14:44:19Z","timestamp":1242657859000},"page":"127-136","source":"Crossref","is-referenced-by-count":12,"title":["On an infinite family of graphs with information ratio 2 \u2212 1\/k"],"prefix":"10.1007","volume":"85","author":[{"given":"L\u00e1szl\u00f3","family":"Csirmaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P\u00e9ter","family":"Ligeti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,5,19]]},"reference":[{"key":"39_CR1","unstructured":"Beimel A, Livne N (2006) On matroids and non-ideal secret sharing, In: Proceedings of the third theory of cryptography conference. LNCS, vol 3876. pp 482\u2013501"},{"key":"39_CR2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00204801","volume":"8","author":"C Blundo","year":"1995","unstructured":"Blundo C, De Santis A, Stinson DR, Vaccaro U (1995) Graph decomposition and secret sharing schemes. J Crypt 8: 39\u201364","journal-title":"J Crypt"},{"key":"39_CR3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1008216403325","volume":"11","author":"C Blundo","year":"1997","unstructured":"Blundo C, De Santis A, Simone RD, Vaccaro U (1997) Tight bounds on the information rate of secret sharing schemes. Des Codes Crypt 11: 107\u2013122","journal-title":"Des Codes Crypt"},{"key":"39_CR4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"RM Capocelli","year":"1993","unstructured":"Capocelli RM, De Santis A, Gargano L, Vaccaro U (1993) On the size of shares of secret sharing schemes. J Crypt 6: 157\u2013168","journal-title":"J Crypt"},{"key":"39_CR5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s001459900029","volume":"10","author":"L Csirmaz","year":"1997","unstructured":"Csirmaz L (1997) The size of a share must be large. J Crypt 10: 223\u2013231","journal-title":"J Crypt"},{"key":"39_CR6","first-page":"297","volume":"44","author":"L Csirmaz","year":"2007","unstructured":"Csirmaz L (2007) Secret sharing schemes on graphs. Stud Math Hung 44: 297\u2013306","journal-title":"Stud Math Hung"},{"key":"39_CR7","unstructured":"Csirmaz L (2005) Secret sharing on the d-dimensional cube"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Csirmaz L, Tardos G (2007) Exact bounds on tree based secret sharing schemes, Tatracrypt 2007, Slovakia","DOI":"10.1556\/sscmath.2007.1021"},{"key":"39_CR9","volume-title":"Information theory. Coding theorems for discrete memoryless systems","author":"I Csisz\u00e1r","year":"1981","unstructured":"Csisz\u00e1r I, K\u00f6rner J (1981) Information theory. Coding theorems for discrete memoryless systems. Academic, New York"},{"key":"39_CR10","unstructured":"GNU Linear Programming Kit. http:\/\/www.gnu.org\/software\/glpk\/"},{"key":"39_CR11","unstructured":"IACR Cryptology ePrint Archive. http:\/\/eprint.iacr.org\/"},{"key":"39_CR12","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s001459900014","volume":"9","author":"W Jackson","year":"1996","unstructured":"Jackson W, Martin KM (1996) Perfect secret sharing schemes on five participants. Des Codes Crypt 9: 233\u2013250","journal-title":"Des Codes Crypt"},{"key":"39_CR13","unstructured":"Library of Efficient Models and Optimization in Networks. http:\/\/lemon.cs.elte.hu"},{"key":"39_CR14","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10623-003-4192-1","volume":"34","author":"J. Mart\u00ec-Farr\u00e9","year":"2005","unstructured":"Mart\u00ec-Farr\u00e9 J., Padr\u00f3 C. (2005) Secret sharing schemes with three or four minimal qualified subsets. Des Codes Crypt 34: 17\u201334","journal-title":"Des Codes Crypt"},{"key":"39_CR15","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0012-365X(99)00004-7","volume":"203","author":"F Matus","year":"1999","unstructured":"Matus F (1999) Matroid representations by partitions. Disc Math 203: 169\u2013194","journal-title":"Disc Math"},{"key":"39_CR16","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A (1979) How to share a secret. Commun ACM 22: 612\u2013613","journal-title":"Commun ACM"},{"key":"39_CR17","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"DR Stinson","year":"1992","unstructured":"Stinson DR (1992) An explication of secret sharing schemes. Des Codes Crypt 2: 357\u2013390","journal-title":"Des Codes Crypt"},{"key":"39_CR18","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/18.272461","volume":"40","author":"DR Stinson","year":"1994","unstructured":"Stinson DR (1994) Decomposition construction for secret sharing schemes. IEEE Trans Inf Theory 40: 118\u2013125","journal-title":"IEEE Trans Inf Theory"},{"key":"39_CR19","first-page":"143","volume":"12","author":"M Dijk van","year":"1997","unstructured":"van Dijk M (1997) On the information rate of perfect secret sharing schemes. Des Codes Crypt 12: 143\u2013169","journal-title":"Des Codes Crypt"},{"key":"39_CR20","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.ipl.2006.01.016","volume":"99","author":"M Dijk van","year":"2006","unstructured":"van Dijk M, Kevenaar T, Schrijen GJ, Tuyls P (2006) Improved constructions of secret sharing schemes by applying (\u03bb,\u03c9)-decompositions. Inf Proc Lett 99: 154\u2013157","journal-title":"Inf Proc Lett"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-009-0039-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-009-0039-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-009-0039-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T05:39:43Z","timestamp":1684993183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-009-0039-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,19]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["39"],"URL":"https:\/\/doi.org\/10.1007\/s00607-009-0039-6","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,19]]}}}