{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T07:28:44Z","timestamp":1777447724211,"version":"3.51.4"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2020,8,14]],"date-time":"2020-08-14T00:00:00Z","timestamp":1597363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,14]],"date-time":"2020-08-14T00:00:00Z","timestamp":1597363200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1816913"],"award-info":[{"award-number":["1816913"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1814298"],"award-info":[{"award-number":["1814298"]}],"id":[{"id":"10.13039\/501100008982","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":[[2020,11]]},"DOI":"10.1007\/s10623-020-00786-z","type":"journal-article","created":{"date-parts":[[2020,8,14]],"date-time":"2020-08-14T13:26:54Z","timestamp":1597411614000},"page":"2361-2376","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Access balancing in storage systems by labeling partial Steiner systems"],"prefix":"10.1007","volume":"88","author":[{"given":"Yeow Meng","family":"Chee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3104-9515","authenticated-orcid":false,"given":"Charles J.","family":"Colbourn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoang","family":"Dau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryan","family":"Gabrys","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan C. H.","family":"Ling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dylan","family":"Lusi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olgica","family":"Milenkovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,14]]},"reference":[{"issue":"3","key":"786_CR1","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0097-3165(82)90049-8","volume":"32","author":"M Ajtai","year":"1982","unstructured":"Ajtai M., Koml\u00f3s J., Pintz J., Spencer J., Szemer\u00e9di E.: Extremal uncrowded hypergraphs. J. Comb. Theory Ser. A 32(3), 321\u2013335 (1982).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"786_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1137\/S0097539797323716","volume":"29","author":"C Bertram-Kretzberg","year":"1999","unstructured":"Bertram-Kretzberg C., Lefmann H.: The algorithmic aspects of uncrowded hypergraphs. SIAM J. Comput. 29(1), 201\u2013230 (1999).","journal-title":"SIAM J. Comput."},{"issue":"4","key":"786_CR3","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1111\/j.1469-1809.1939.tb02219.x","volume":"9","author":"RC Bose","year":"1939","unstructured":"Bose R.C.: On the construction of balanced incomplete block designs. Ann. Eugenics 9(4), 353\u2013399 (1939).","journal-title":"Ann. Eugenics"},{"key":"786_CR4","unstructured":"Brummond, W.M.: Kirkman systems that attain the upper bound on the minimum block sum, for access balancing in distributed storage (2019). arXiv:1906.02157."},{"issue":"4","key":"786_CR5","doi-asserted-by":"publisher","first-page":"2603","DOI":"10.1137\/17M1114338","volume":"31","author":"D Bryant","year":"2017","unstructured":"Bryant D., Colbourn C.J., Horsley D., Wanless I.M.: Steiner triple systems with high chromatic index. SIAM J. Discret. Math. 31(4), 2603\u20132611 (2017).","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"786_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/00029890.1914.11997995","volume":"21","author":"WH Bussey","year":"1914","unstructured":"Bussey W.H.: The tactical problem of Steiner. Am. Math. Monthly 21(1), 3\u201312 (1914).","journal-title":"Am. Math. Monthly"},{"key":"786_CR7","doi-asserted-by":"crossref","unstructured":"Chee Y.M., Colbourn C.J., Dau H., Gabrys R., Ling A.C.H., Lusi D., Milenkovic O.: Access balancing in storage systems by labeling partial Steiner systems. In: 2020 IEEE International Symposium on Information Theory (2020).","DOI":"10.1109\/ISIT44484.2020.9174154"},{"issue":"2","key":"786_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/176979.176981","volume":"26","author":"PM Chen","year":"1994","unstructured":"Chen P.M., Lee E.K., Gibson G.A., Katz R.H., Patterson D.A.: RAID: high-performance, reliable secondary storage. ACM Comput. Surv. 26(2), 145\u2013185 (1994).","journal-title":"ACM Comput. Surv."},{"key":"786_CR9","unstructured":"Cidon A., Rumble S.M., Stutsman R., Katti S., Ousterhout J.K., Rosenblum M.: Copysets: Reducing the frequency of data loss in cloud storage. In: Usenix Annual Technical Conference, pp. 37\u201348 (2013)."},{"key":"786_CR10","series-title":"Oxford Mathematical Monographs","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198535768.001.0001","volume-title":"Triple Systems","author":"CJ Colbourn","year":"1999","unstructured":"Colbourn C.J., Rosa A.: Triple Systems. Oxford Mathematical MonographsClarendon Press, Oxford (1999)."},{"issue":"2","key":"786_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0166-218X(82)90068-3","volume":"4","author":"CJ Colbourn","year":"1982","unstructured":"Colbourn C.J., Colbourn M.J., Phelps K.T., R\u00f6dl V.: Colouring Steiner quadruple systems. Discret. Appl. Math. 4(2), 103\u2013111 (1982).","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"786_CR12","doi-asserted-by":"publisher","first-page":"1644","DOI":"10.1137\/17M1143964","volume":"32","author":"H Dau","year":"2018","unstructured":"Dau H., Milenkovic O.: MaxMinSum Steiner systems for access balancing in distributed storage. SIAM J. Discret. Math. 32(3), 1644\u20131671 (2018).","journal-title":"SIAM J. Discret. Math."},{"key":"786_CR13","first-page":"393","volume":"23","author":"J Doyen","year":"1971","unstructured":"Doyen J., Vandensavel M.: Non isomorphic Steiner quadruple systems. Bull. Soc. Math. Belg. 23, 393\u2013410 (1971).","journal-title":"Bull. Soc. Math. Belg."},{"issue":"2\u20133","key":"786_CR14","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/rsa.3240060208","volume":"6","author":"RA Duke","year":"1995","unstructured":"Duke R.A., Lefmann H., R\u00f6dl V.: On uncrowded hypergraphs. Random Struct. Algorithms 6(2\u20133), 209\u2013212 (1995).","journal-title":"Random Struct. Algorithms"},{"key":"786_CR15","unstructured":"El\u00a0Rouayheb S., Ramchandran K.: Fractional repetition codes for repair in distributed storage systems. In: 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 1510\u20131517. IEEE (2010)."},{"key":"786_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF02020444","volume":"17","author":"P Erd\u0151s","year":"1966","unstructured":"Erd\u0151s P., Hajnal A.: On chromatic number of graphs and set-systems. Acta Math. Acad. Sci. Hungar 17, 61\u201399 (1966).","journal-title":"Acta Math. Acad. Sci. Hungar"},{"issue":"2","key":"786_CR17","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1017\/S0963548312000557","volume":"22","author":"A Eustis","year":"2013","unstructured":"Eustis A., Verstra\u00ebte J.: On the independence number of Steiner systems. Comb. Probab. Comput. 22(2), 241\u2013252 (2013).","journal-title":"Comb. Probab. Comput."},{"key":"786_CR18","doi-asserted-by":"crossref","unstructured":"Fazeli A., Vardy A., Yaakobi E.: Codes for distributed PIR with low storage overhead. In: 2015 IEEE International Symposium on Information Theory (ISIT), pp. 2852\u20132856. IEEE (2015).","DOI":"10.1109\/ISIT.2015.7282977"},{"issue":"2","key":"786_CR19","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1002\/(SICI)1098-2418(199603)8:2<131::AID-RSA4>3.0.CO;2-Z","volume":"8","author":"AD Fundia","year":"1996","unstructured":"Fundia A.D.: Derandomizing Chebyshev\u2019s inequality to find independent sets in uncrowded hypergraphs. Random Struct. Algorithms 8(2), 131\u2013147 (1996).","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"786_CR20","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF01200754","volume":"15","author":"DA Grable","year":"1995","unstructured":"Grable D.A., Phelps K.T., R\u00f6dl V.: The minimum independence number for designs. Combinatorica 15(2), 175\u2013185 (1995).","journal-title":"Combinatorica"},{"issue":"A","key":"786_CR21","first-page":"55","volume":"25","author":"MJ Grannell","year":"1988","unstructured":"Grannell M.J., Griggs T.S., Phelan J.S.: A new look at an old construction for Steiner triple systems. ARS Comb. 25(A), 55\u201360 (1988).","journal-title":"ARS Comb."},{"issue":"1","key":"786_CR22","doi-asserted-by":"publisher","first-page":"154","DOI":"10.7146\/math.scand.a-10603","volume":"8","author":"H Hanani","year":"1960","unstructured":"Hanani H.: A note on Steiner triple systems. Math. Scand. 8(1), 154\u2013156 (1960).","journal-title":"Math. Scand."},{"issue":"9","key":"786_CR23","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/143371.143383","volume":"27","author":"M Holland","year":"1992","unstructured":"Holland M., Gibson G.A.: Parity declustering for continuous operation in redundant disk arrays. SIGPLAN Not. 27(9), 23\u201335 (1992).","journal-title":"SIGPLAN Not."},{"issue":"6","key":"786_CR24","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1016\/j.ejc.2006.04.009","volume":"28","author":"L Ji","year":"2007","unstructured":"Ji L.: A construction for 2-chromatic Steiner quadruple systems. Eur. J. Comb. 28(6), 1832\u20131838 (2007).","journal-title":"Eur. J. Comb."},{"issue":"2","key":"786_CR25","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1002\/rsa.1020","volume":"19","author":"A Kostochka","year":"2001","unstructured":"Kostochka A., Mubayi D., R\u00f6dl V., Tetali P.: On the chromatic number of set systems. Random Struct. Algorithms 19(2), 87\u201398 (2001).","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"786_CR26","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1002\/rsa.20453","volume":"44","author":"A Kostochka","year":"2014","unstructured":"Kostochka A., Mubayi D., Verstra\u00ebte J.: On independent sets in hypergraphs. Random Struct. Algorithms 44(2), 224\u2013239 (2014).","journal-title":"Random Struct. Algorithms"},{"key":"786_CR27","unstructured":"Lov\u00e1sz L.: Coverings and coloring of hypergraphs. In: Proceedings of the Fourth Southeastern Conference on Combinatorics, Graph Theory, and Computing. Florida Atlantic University, Boca Raton, pp. 3\u201312 (1973)."},{"key":"786_CR28","doi-asserted-by":"crossref","unstructured":"Lusi D., Colbourn C.J.: On the maximum double independence number of Steiner triple systems. J. Comb. Des. to appear (2020).","DOI":"10.1002\/jcd.21730"},{"key":"786_CR29","first-page":"167","volume":"21","author":"KT Phelps","year":"1986","unstructured":"Phelps K.T., R\u00f6dl V.: Steiner triple systems with minimum independence number. ARS Comb. 21, 167\u2013172 (1986).","journal-title":"ARS Comb."},{"issue":"3","key":"786_CR30","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0195-6698(80)80009-6","volume":"1","author":"KT Phelps","year":"1980","unstructured":"Phelps K.T., Rosa A.: $$2$$-Chromatic Steiner quadruple systems. Eur. J. Comb. 1(3), 253\u2013258 (1980).","journal-title":"Eur. J. Comb."},{"issue":"3","key":"786_CR31","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/0097-3165(79)90038-4","volume":"27","author":"D Quiring","year":"1979","unstructured":"Quiring D.: A construction of disjoint Steiner triple systems. J. Comb. Theory Ser. A 27(3), 407\u2013408 (1979).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"786_CR32","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/rsa.3240050117","volume":"5","author":"V R\u00f6dl","year":"1994","unstructured":"R\u00f6dl V., \u0160i\u0148ajov\u00e1 E.: Note on independent sets in Steiner systems. Random Struct. Algorithms 5(1), 183\u2013190 (1994).","journal-title":"Random Struct. Algorithms"},{"issue":"3","key":"786_CR33","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0097-3165(73)90082-4","volume":"15","author":"S Schreiber","year":"1973","unstructured":"Schreiber S.: Covering all triples on n marks by disjoint Steiner systems. J. Comb. Theory Ser. A 15(3), 347\u2013350 (1973).","journal-title":"J. Comb. Theory Ser. A"},{"key":"786_CR34","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02882230","volume":"17","author":"S Schreiber","year":"1974","unstructured":"Schreiber S.: Some mappings of periodic groups. Israel J. Math. 17, 117\u2013123 (1974).","journal-title":"Israel J. Math."},{"issue":"8","key":"786_CR35","doi-asserted-by":"publisher","first-page":"4164","DOI":"10.1109\/TIT.2015.2442231","volume":"61","author":"N Silberstein","year":"2015","unstructured":"Silberstein N., Etzion T.: Optimal fractional repetition codes based on graphs and designs. IEEE Trans. Inf. Theory 61(8), 4164\u20134180 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"786_CR36","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10623-014-0007-9","volume":"78","author":"N Silberstein","year":"2016","unstructured":"Silberstein N., G\u00e1l A.: Optimal combinatorial batch codes based on block designs. Des. Codes Cryptogr. 78(2), 409\u2013424 (2016).","journal-title":"Des. Codes Cryptogr."},{"key":"786_CR37","first-page":"273","volume":"1","author":"T Skolem","year":"1959","unstructured":"Skolem T.: Some remarks on the triple systems of Steiner. Math. Scand. 1, 273\u2013280 (1959).","journal-title":"Math. Scand."},{"key":"786_CR38","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0012-365X(72)90084-2","volume":"2","author":"J Spencer","year":"1972","unstructured":"Spencer J.: Tur\u00e1n\u2019s theorem for $$k$$-graphs. Discret. Math. 2, 183\u2013186 (1972).","journal-title":"Discret. Math."},{"issue":"5","key":"786_CR39","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/s00373-018-1911-y","volume":"34","author":"F Tian","year":"2018","unstructured":"Tian F., Liu Z.L.: Bounding the independence number in some $$(n, k,\\ell,\\lambda )$$-hypergraphs. Graphs Comb. 34(5), 845\u2013861 (2018).","journal-title":"Graphs Comb."},{"key":"786_CR40","series-title":"Hypergraph Seminar","first-page":"267","volume-title":"Some Partitions of All Triples into Steiner Triple Systems","author":"RM Wilson","year":"1974","unstructured":"Wilson R.M.: Some Partitions of All Triples into Steiner Triple Systems, pp. 267\u2013277. Hypergraph SeminarSpringer, New York (1974)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00786-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-020-00786-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00786-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T20:28:37Z","timestamp":1723408117000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-020-00786-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,14]]},"references-count":40,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["786"],"URL":"https:\/\/doi.org\/10.1007\/s10623-020-00786-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,14]]},"assertion":[{"value":"28 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}