{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:06:05Z","timestamp":1754161565396,"version":"3.41.2"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1023\/a:1024140122167","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T17:56:22Z","timestamp":1063389382000},"page":"71-89","source":"Crossref","is-referenced-by-count":2,"title":["Projective Planes, Coverings and a Network Problem"],"prefix":"10.1007","volume":"29","author":[{"given":"J\u00fcrgen","family":"Bierbrauer","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Marcugini","sequence":"additional","affiliation":[]},{"given":"Fernanda","family":"Pambianco","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5122114_CR1","doi-asserted-by":"crossref","unstructured":"J. C. Bermond, J. Bond, M. Paoli and C. Peyrat, Graphs and interconnecting networks: diameter and vulnerability, In (E. K. Lloyd, ed.), Surveys in Combinatorics, Cambridge Univ. Press (1983) pp. 1\u201330.","DOI":"10.1017\/CBO9781107325548.002"},{"key":"5122114_CR2","doi-asserted-by":"crossref","unstructured":"A. Blokhuis, D. Jungnickel and B. Schmidt, On a class of symmetric divisible designs which are almost projective planes, In (A. Blokhuis, J. W. P. Hirschfeld, D. Jungnickel, J. A. Thas, eds.) Finite Geometries Kluwer (2001) pp. 27\u201334.","DOI":"10.1007\/978-1-4613-0283-4_2"},{"key":"5122114_CR3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1214\/aoms\/1177729382","volume":"23","author":"R. C. Bose","year":"1952","unstructured":"R. C. Bose and W. S. Connor, Combinatorial properties of group divisible incomplete block designs, Ann. Math. Statistics, Vol. 23 (1952) pp. 367\u2013383.","journal-title":"Ann. Math. Statistics"},{"key":"5122114_CR4","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1214\/aoms\/1177729027","volume":"24","author":"R. C. Bose","year":"1953","unstructured":"R. C. Bose, S. S. Shrikhande and K. N. Bhattacharya, On the construction of group divisible incomplete block designs, Annals of Mathematical Statistics, Vol. 24 (1953) pp. 167\u2013195.","journal-title":"Annals of Mathematical Statistics"},{"key":"5122114_CR5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0166-218X(01)00356-0","volume":"122","author":"C. J. Colbourn","year":"2002","unstructured":"C. J. Colbourn, Projective planes and congestion-free networks, Discrete Applied Mathematics, Vol. 122 (2002) pp. 117\u2013126.","journal-title":"Discrete Applied Mathematics"},{"key":"5122114_CR6","doi-asserted-by":"crossref","unstructured":"C. J. Colbourn, J. H. Dinitz and D. R. Stinson, Applications of combinatorial designs to communications, cryptography and networking, In Surveys in Combinatorics 1999, Cambridge University Press (1999) pp. 37\u2013100 (1999 British Combinatorial Conference).","DOI":"10.1017\/CBO9780511721335.004"},{"key":"5122114_CR7","doi-asserted-by":"crossref","unstructured":"P. Dembowski, Finite Geometries, Springer (1968).","DOI":"10.1007\/978-3-642-62012-6"},{"key":"5122114_CR8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02579271","volume":"6","author":"Z. F\u00fcredi","year":"1981","unstructured":"Z. F\u00fcredi, Maximum degree and fractional matchings in uniform hypergraphs, Combinatorica, Vol. 6 (1981) pp. 155\u2013162.","journal-title":"Combinatorica"},{"key":"5122114_CR9","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0012-365X(89)90088-5","volume":"75","author":"Z. F\u00fcredi","year":"1989","unstructured":"Z. F\u00fcredi, Covering the complete graph by partitions, Discrete Mathematics, Vol. 75 (1989) pp. 217\u2013226.","journal-title":"Discrete Mathematics"},{"key":"5122114_CR10","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1147\/rd.45.0532","volume":"4","author":"J. H. Griesmer","year":"1960","unstructured":"J. H. Griesmer, A bound for error-correcting codes, IBM Journal Research Development, Vol. 4 (1960) pp. 532\u2013542.","journal-title":"IBM Journal Research Development"},{"key":"5122114_CR11","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0167-5060(08)70702-7","volume":"6","author":"N. Hamada","year":"1980","unstructured":"N. Hamada and F. Tamari, Construction of optimal codes and optimal fractional factorial designs using linear programming, Annals of Discrete Mathematics, Vol. 6 (1980) pp. 175\u2013188.","journal-title":"Annals of Discrete Mathematics"},{"key":"5122114_CR12","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/S0019-9958(65)90080-X","volume":"8","author":"G. Solomon","year":"1965","unstructured":"G. Solomon and J. J. Stiffler, Algebraically punctured cyclic codes, Information and Control, Vol. 8 (1965) pp. 170\u2013179.","journal-title":"Information and Control"},{"key":"5122114_CR13","first-page":"181","volume":"90","author":"D. Wiedemann","year":"1992","unstructured":"D. Wiedemann, Cyclic difference covers through 133, Congressus Numerantium, Vol. 90 (1992) pp. 181\u2013185.","journal-title":"Congressus Numerantium"},{"key":"5122114_CR14","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1109\/90.650156","volume":"5","author":"B. Yener","year":"1997","unstructured":"B. Yener, Y. Ofek and M. Yung, Combinatorial design of congestion-free networks, IEEE\/ACM Trans. Networking, Vol. 5 (1997) pp. 989\u20131000.","journal-title":"IEEE\/ACM Trans. Networking"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024140122167.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1024140122167\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024140122167.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:36:46Z","timestamp":1753760206000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1024140122167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["5122114"],"URL":"https:\/\/doi.org\/10.1023\/a:1024140122167","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}