{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:21:52Z","timestamp":1775053312402,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"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":[[1999,5]]},"DOI":"10.1023\/a:1008340128973","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T09:41:38Z","timestamp":1040550098000},"page":"271-289","source":"Crossref","is-referenced-by-count":20,"title":["Designs in Product Association Schemes"],"prefix":"10.1007","volume":"16","author":[{"given":"William J.","family":"Martin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"199821_CR1","series-title":"Benjamin-Cummings Lecture Note Ser.","volume-title":"Algebraic Combinatorics I: Association Schemes","author":"E. Bannai","year":"1984","unstructured":"E. Bannai and T. Ito, Algebraic Combinatorics I: Association Schemes, Benjamin-Cummings Lecture Note Ser. 58, The Benjamin-Cummings Publishing Company, Inc., London (1984)."},{"key":"199821_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance-Regular Graphs","author":"A. E. Brouwer","year":"1989","unstructured":"A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regular Graphs, Springer-Verlag, Berlin (1989)."},{"key":"199821_CR3","doi-asserted-by":"crossref","DOI":"10.1201\/9781420049954","volume-title":"Handbook of Combinatorial Designs","author":"C. J. Colbourn","year":"1996","unstructured":"C. J. Colbourn and J. H. Dinitz, Handbook of Combinatorial Designs, CRC Press, Boca Raton (1996)."},{"key":"199821_CR4","unstructured":"P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Res. Reports Suppl., Vol. 10 (1973)."},{"key":"199821_CR5","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/0097-3165(76)90017-0","volume":"20","author":"P. Delsarte","year":"1976","unstructured":"P. Delsarte, Association schemes and t-designs in regular semilattices, J. Combin. Th. (A), Vol. 20 (1976) pp. 230-243.","journal-title":"J. Combin. Th. (A)"},{"key":"199821_CR6","first-page":"373","volume":"32","author":"P. Delsarte","year":"1977","unstructured":"P. Delsarte, Pairs of vectors in the space of an association scheme, Philips Res. Reports, Vol. 32 (1977) pp. 373-411.","journal-title":"Philips Res. Reports"},{"key":"199821_CR7","volume-title":"Contemporary Design Theory: A Collection of Surveys","year":"1992","unstructured":"J. H. Dinitz and D. R. Stinson (eds.), Contemporary Design Theory: A Collection of Surveys, Wiley, New York (1992)."},{"key":"199821_CR8","volume-title":"Algebraic Combinatorics","author":"C. D. Godsil","year":"1993","unstructured":"C. D. Godsil, Algebraic Combinatorics, Chapman and Hall, London (1993)."},{"key":"199821_CR9","volume-title":"Orthogonal Arrays","author":"A. S. Hedayat","year":"1998","unstructured":"A. S. Hedayat, N. J. A. Sloane and J. Stufken, Orthogonal Arrays, Springer-Verlag, New York (1998)."},{"key":"199821_CR10","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1008207230165","volume":"12","author":"V. Levenshtein","year":"1997","unstructured":"V. Levenshtein, Split orthogonal arrays and maximum resilient systems of functions, Designs, Codes and Crypt., Vol. 12 (1997) pp. 131-160.","journal-title":"Designs, Codes and Crypt."},{"issue":"2","key":"199821_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/(SICI)1520-6610(1998)6:2<151::AID-JCD5>3.0.CO;2-E","volume":"6","author":"W. J. Martin","year":"1998","unstructured":"W. J. Martin, Mixed block designs, J. Combin. Designs, Vol. 6,No. 2 (1998) pp. 151-163.","journal-title":"J. Combin. Designs"},{"key":"199821_CR12","unstructured":"W. J. Martin, Completely regular designs, to appear in J. Combin. Designs."},{"key":"199821_CR13","unstructured":"W. J. Martin and D.R. Stinson, Association schemes for ordered orthogonal arrays and (T, M, S)-nets, (1997), submitted for publication."},{"key":"199821_CR14","unstructured":"A. D. Meyerowitz, Cycle-balanced partitions in distance-regular graphs, preprint."},{"key":"199821_CR15","doi-asserted-by":"crossref","first-page":"2102","DOI":"10.1214\/aos\/1034713649","volume":"23","author":"R. Mukerjee","year":"1995","unstructured":"R. Mukerjee and C. F. J. Wu, On the existence of saturated and nearly saturated asymmetrical orthogonal arrays, Ann. Stat., Vol. 23 (1995) pp. 2102-2115.","journal-title":"Ann. Stat."},{"key":"199821_CR16","first-page":"98","volume":"7","author":"C. Roos","year":"1982","unstructured":"C. Roos, On antidesigns and designs in an association scheme, Delft Progress Report, Vol. 7 (1982) pp. 98-109.","journal-title":"Delft Progress Report"},{"key":"199821_CR17","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0378-3758(96)00025-0","volume":"56","author":"N. J. A. Sloane","year":"1996","unstructured":"N. J. A. Sloane and J. Stufken, A linear programming bound for orthogonal arrays with mixed levels, J. Stat. Plan. Inf., Vol. 56 (1996) pp. 295-306.","journal-title":"J. Stat. Plan. Inf."},{"key":"199821_CR18","first-page":"57","volume":"25","author":"S. Y. Song","year":"1987","unstructured":"S. Y. Song, Posets related to some association schemes, Journal of the Korean Society of Mathematical Education, Vol. 25 (1987) pp. 57-69.","journal-title":"Journal of the Korean Society of Mathematical Education"},{"key":"199821_CR19","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF01788103","volume":"2","author":"D. Stanton","year":"1986","unstructured":"D. Stanton, t-Designs in classical association schemes, Graphs Combin., Vol. 2 (1986) pp. 283-286.","journal-title":"Graphs Combin."},{"key":"199821_CR20","volume-title":"Coding Theory and Design Theory, Proceedings of the IMA","author":"P. Terwilliger","year":"1991","unstructured":"P. Terwilliger, Incidence algebras of uniform posets, in: Coding Theory and Design Theory, Proceedings of the IMA (D. K. Ray-Chaudhuri, ed.), Springer-Verlag, New York (1991)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008340128973.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008340128973\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008340128973.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:17:29Z","timestamp":1753759049000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008340128973"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["199821"],"URL":"https:\/\/doi.org\/10.1023\/a:1008340128973","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}