{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T16:41:20Z","timestamp":1759941680680},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,12,8]],"date-time":"2006-12-08T00:00:00Z","timestamp":1165536000000},"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":[[2007,1,9]]},"DOI":"10.1007\/s10623-006-9025-6","type":"journal-article","created":{"date-parts":[[2006,12,7]],"date-time":"2006-12-07T15:25:42Z","timestamp":1165505142000},"page":"127-143","source":"Crossref","is-referenced-by-count":13,"title":["A direct approach to linear programming bounds for codes and tms-nets"],"prefix":"10.1007","volume":"42","author":[{"given":"J\u00fcrgen","family":"Bierbrauer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,12,8]]},"reference":[{"key":"9025_CR1","doi-asserted-by":"crossref","unstructured":"Bierbrauer J (2004) Introduction to coding theory. Chapman & Hall\/CRC Press","DOI":"10.1201\/9781482296372"},{"key":"9025_CR2","first-page":"272","volume":"27","author":"P Delsarte","year":"1972","unstructured":"Delsarte P (1972) Bounds for unrestricted codes by linear programming. Philips Res Rep 27: 272\u2013289","journal-title":"Philips Res Rep"},{"key":"9025_CR3","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0019-9958(73)80007-5","volume":"23","author":"P Delsarte","year":"1973","unstructured":"Delsarte P (1973) Four fundamental parameters of a code and their combinatorial significance. Inform Control 23:407\u2013438","journal-title":"Inform Control"},{"key":"9025_CR4","unstructured":"Delsarte P (1973) An algebraic approach to the association schemes of coding theory. Philips Res Rep Suppl 10"},{"key":"9025_CR5","doi-asserted-by":"crossref","first-page":"359","DOI":"10.4153\/CMB-1999-042-x","volume":"42","author":"WJ Martin","year":"1999","unstructured":"Martin WJ, Stinson DR (1999) A generalized Rao bound for ordered orthogonal arrays and (t,m,s)-nets. Can Math Bull 42:359\u2013370","journal-title":"Can Math Bull"},{"key":"9025_CR6","doi-asserted-by":"crossref","first-page":"326","DOI":"10.4153\/CJM-1999-017-5","volume":"51","author":"WJ Martin","year":"1999","unstructured":"Martin WJ, Stinson DR (1999) Association schemes for ordered orthogonal arrays and (t,m,s)-nets. Can J Math 51:326\u2013346","journal-title":"Can J Math"},{"key":"9025_CR7","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/978-3-642-59657-5_25","volume-title":"Monte Carlo and Quasi-Monte Carlo methods 1998","author":"WJ Martin","year":"2000","unstructured":"Martin WJ (2000) Linear programming bounds for ordered orthogonal arrays and (t,m,s)-nets. In: Niederreiter H, Spanier J (eds), Monte Carlo and Quasi-Monte Carlo methods 1998. Springer, Berlin, pp 368\u2013376"},{"key":"9025_CR8","doi-asserted-by":"crossref","unstructured":"Martin WJ (2001) Design systems: combinatorial characterizations of Delsarte T-designs via partially ordered sets. In: Barg A, Litsyn S (eds), Codes and Association Schemes, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol 56. American Mathematical Society pp 223\u2013239","DOI":"10.1090\/dimacs\/056\/18"},{"key":"9025_CR9","unstructured":"Martin WJ, Visentin TI A dual Plotkin bound for (t,m,s)-nets, manuscript"},{"key":"9025_CR10","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF01294651","volume":"104","author":"H Niederreiter","year":"1987","unstructured":"Niederreiter H (1987) Point sets and sequences with small discrepancy. Monatsh Math 104: 273\u2013337","journal-title":"Monatsh Math"},{"key":"9025_CR11","doi-asserted-by":"crossref","unstructured":"Sch\u00fcrer R, Schmid WCh MinT: a database for optimal net parameters. In: Niederreiter H, Talay D (eds) Monte Carlo and Quasi-Monte Carlo Methods 2004. Springer-Verlag, Berlin, pp 457\u2013469","DOI":"10.1007\/3-540-31186-6_28"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-006-9025-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-006-9025-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-006-9025-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:50:07Z","timestamp":1559245807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-006-9025-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,8]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,1,9]]}},"alternative-id":["9025"],"URL":"https:\/\/doi.org\/10.1007\/s10623-006-9025-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,8]]}}}