{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:44:55Z","timestamp":1775054695345,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1959,6,1]],"date-time":"1959-06-01T00:00:00Z","timestamp":-334108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,5,15]],"date-time":"2014-05-15T00:00:00Z","timestamp":1400112000000},"content-version":"vor","delay-in-days":20072,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1959,6]]},"DOI":"10.1016\/s0019-9958(59)90376-6","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"183-194","source":"Crossref","is-referenced-by-count":27,"title":["A note on a result in the theory of code construction"],"prefix":"10.1016","volume":"2","author":[{"given":"R.C.","family":"Bose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.S.","family":"Shrikhande","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(59)90376-6_bib1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1111\/j.1469-1809.1939.tb02219.x","article-title":"On the construction of balanced incomplete block designs","volume":"9","author":"Bose","year":"1939","journal-title":"Annals of Eugenics"},{"key":"10.1016\/S0019-9958(59)90376-6_bib2","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01174141","article-title":"On a new class of Hadamard determinants","volume":"58","author":"Brauer","year":"1953","journal-title":"Math. Z."},{"key":"10.1016\/S0019-9958(59)90376-6_bib3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0019-9958(58)80006-6","article-title":"A note on upper bounds for minimum distance codes","volume":"1","author":"Joshi","year":"1958","journal-title":"Inform. and Control"},{"key":"10.1016\/S0019-9958(59)90376-6_bib4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","article-title":"Error detecting and error correcting codes","volume":"29","author":"Hamming","year":"1950","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0019-9958(59)90376-6_bib5","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1002\/sapm1933121311","article-title":"On orthogonal matrices","volume":"12","author":"Paley","year":"1933","journal-title":"J. Math. and Phys."},{"key":"10.1016\/S0019-9958(59)90376-6_bib6","article-title":"Binary codes with specified minimum distance","author":"Plotkin","year":"1951"},{"key":"10.1016\/S0019-9958(59)90376-6_bib7","first-page":"125","article-title":"Sur un probl\u00e8me du codage binaire","volume":"2","author":"Sch\u00fctzenberger","year":"1953","journal-title":"Publ. Inst. statist. Univ. Paris"},{"key":"10.1016\/S0019-9958(59)90376-6_bib8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/j.1538-7305.1956.tb02379.x","article-title":"A class of binary signalling alphabets","volume":"35","author":"Slepian","year":"1956","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0019-9958(59)90376-6_bib9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.4153\/CJM-1958-008-5","article-title":"A family of difference sets","volume":"10","author":"Stanton","year":"1958","journal-title":"Canadian J. of Math."},{"key":"10.1016\/S0019-9958(59)90376-6_bib10","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1002\/sapm1933121321","article-title":"A combinatorial problem","volume":"12","author":"Todd","year":"1933","journal-title":"J. of Math. and Phys."},{"key":"10.1016\/S0019-9958(59)90376-6_bib11","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1215\/S0012-7094-44-01108-7","article-title":"Hadamard determinant theorem and sum of four squares","volume":"11","author":"Williamson","year":"1944","journal-title":"Duke Math. J."},{"key":"10.1016\/S0019-9958(59)90376-6_bib12","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1090\/S0002-9904-1947-08853-4","article-title":"Note on Hadamard's determinantal problem","volume":"53","author":"Williamson","year":"1947","journal-title":"Bull. Am. Math. Soc. series 2"},{"key":"10.1016\/S0019-9958(59)90376-6_bib13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1111\/j.1469-1809.1936.tb02134.x","article-title":"Incomplete randomised blocks","volume":"7","author":"Yates","year":"1936","journal-title":"Annals of Eugenics"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995859903766?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995859903766?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T14:28:10Z","timestamp":1548944890000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995859903766"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1959,6]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1959,6]]}},"alternative-id":["S0019995859903766"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(59)90376-6","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1959,6]]}}}