{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T10:34:12Z","timestamp":1777372452886,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[2005,6]]},"DOI":"10.1007\/s10623-003-6738-7","type":"journal-article","created":{"date-parts":[[2005,4,5]],"date-time":"2005-04-05T13:04:10Z","timestamp":1112706250000},"page":"271-285","source":"Crossref","is-referenced-by-count":4,"title":["The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments"],"prefix":"10.1007","volume":"35","author":[{"given":"Harri","family":"Haanp\ufffd\ufffd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petteri","family":"Kaski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Combinatorial Designs: Construction Methods","author":"I Anderson","year":"1990"},{"key":"CR2","first-page":"129","volume":"19","author":"I. Anderson","year":"1995","journal-title":"Journal of Combinatorial Mathematics Combinational Computation"},{"key":"CR3","first-page":"504","volume-title":"The CRC Handbook of Combinatorial Designs","author":"I Anderson","year":"1996"},{"key":"CR4","first-page":"89","volume":"14","author":"R. Baker","year":"1975","journal-title":"Congressus Numerautium"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/BF02112298","volume":"40","author":"F. E. Bennett","year":"1990","journal-title":"Aequationes Mathematical"},{"key":"CR6","unstructured":"I. A. Farad?ev, Constructive enumeration of combinatorial objects, Colloq Internat CNRS, 260, CNRS, Paris (1978) pp. 131?135."},{"key":"CR7","first-page":"15","volume":"82","author":"N. J. Finizio","year":"1991","journal-title":"Congressus Numerantium"},{"key":"CR8","unstructured":"The GAP Group, GAP ?- Groups, Algorithms, and Programming, Version 4.3; 2002. (http:\/\/www.gap-system.org)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0097-3165(02)00018-3","volume":"101","author":"G. Ge","year":"2003","journal-title":"J. Combinatorial Theory, Series A"},{"key":"CR10","first-page":"53","volume":"32","author":"G. Ge","year":"2001","journal-title":"Bull. Inst. Combin. appl."},{"key":"CR11","first-page":"718","volume-title":"The CRC Handbook of Combinatorial Designs","author":"PB Gibbons","year":"1996"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"2495","DOI":"10.1002\/j.1538-7305.1971.tb02618.x","volume":"50","author":"R. L. Graham","year":"1971","journal-title":"Bell System Technical Journal"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/S0166-218X(02)00578-4","volume":"129","author":"H. Haanp\ufffd\ufffd","year":"2003","journal-title":"Discrete Applied Mathematics"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/jcd.1016","volume":"9","author":"P. Kaski","year":"2001","journal-title":"Journal of Combinatorial Designs"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1002\/(SICI)1520-6610(1997)5:4<249::AID-JCD2>3.0.CO;2-F","volume":"5","author":"Y. Lu","year":"1997","journal-title":"Journal of Combinatorial Designs"},{"key":"CR16","unstructured":"R. Mathon and A. Rosa, 2-(?, k, ?) designs of small order, In C. J. Colbourn and J. H. Dinitz, CRC Press, Boca Raton (1996) pp. 3?41."},{"key":"CR17","unstructured":"B. D. McKay, autoson ? a distributed batch system for UNIX workstation networks (version 1.3), Technical Report TR-CS-96-03, Computer Science Department, Australian National University (1996)."},{"key":"CR18","unstructured":"B. D. McKay, nauty user?s guide (version 1.5). Technical Report TR-CS-90-02, Computer Science Department, Australian National University (1990)."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1002\/jcd.1019","volume":"9","author":"L. B. Morales","year":"2001","journal-title":"Journal of Combinatorial Designs"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"PRJ \ufffdsterg\ufffdrd","year":"2002","journal-title":"Discrete Applied Mathematics"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0167-5060(08)70325-X","volume":"2","author":"R. C. Read","year":"1978","journal-title":"Annals of Discrete Mathematics"},{"key":"CR22","unstructured":"N.V. Semakov and V.A. Zinov?ev, Equidistant q-ary codes with maximal distance and resolvable balanced incomplete block designs, Problems of Information Transmission, Vol. 4, No. 2 (1968) pp. 1--7; translated from Problemy Peredachi Informatsii , Vol. 4, No. 2 (1968) pp. 3--10 (Russian)."},{"key":"CR23","unstructured":"T. Syrj\ufffdnen and I. Niemel\ufffd, The Smodels system, In T. Eiter, W. Faber, M. Truszczy?ski, (eds.), Logic Programming and Nonmonotonic Reasoning: Proc. 6th International Conference, LPNMR 2001, Lecture Notes in Artificial Intelligence, Springer, Berlin, 2173 (2001) pp. 434?438."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF02579350","volume":"3","author":"PM Winkler","year":"1983","journal-title":"Combinatoria"},{"key":"CR25","first-page":"3","volume":"42","author":"X. Zhang","year":"1996","journal-title":"Ars Combinatoria"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-003-6738-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-003-6738-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-003-6738-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:50:03Z","timestamp":1559245803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-003-6738-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["6738"],"URL":"https:\/\/doi.org\/10.1007\/s10623-003-6738-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}