{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:33:40Z","timestamp":1648906420223},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T00:00:00Z","timestamp":1268352000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1007\/s10623-010-9380-1","type":"journal-article","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T18:59:06Z","timestamp":1268420346000},"page":"1-9","source":"Crossref","is-referenced-by-count":0,"title":["An equivalence of Ward\u2019s bound and its application"],"prefix":"10.1007","volume":"58","author":[{"given":"Xiaoyu","family":"Liu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,3,12]]},"reference":[{"key":"9380_CR1","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s10623-009-9286-y","volume":"52","author":"J.-L. Kim","year":"2009","unstructured":"Kim J.-L., Liu X.: Ageneralized Gleason-Pierce-Ward theorem. Des. Codes Cryptogr. 52, 363\u2013380 (2009)","journal-title":"Des. Codes Cryptogr."},{"key":"9380_CR2","volume-title":"Elementary Number Theory","author":"J.V. Uspensky","year":"1939","unstructured":"Uspensky J.V., Heaslit M.A.: Elementary Number Theory. McGraw-Hill, New York (1939)"},{"key":"9380_CR3","volume-title":"A Course in Combinatorics","author":"J.H. Van Lint","year":"1992","unstructured":"Van Lint J.H., Wilson R.M.: A Course in Combinatorics. Cambridge University Press, Cambridge (1992)"},{"key":"9380_CR4","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF01223730","volume":"36","author":"H.N. Ward","year":"1981","unstructured":"Ward H.N.: Divisible codes. Arch. Math. 36, 485\u2013499 (1981)","journal-title":"Arch. Math."},{"key":"9380_CR5","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1109\/18.108271","volume":"38","author":"H.N. Ward","year":"1992","unstructured":"Ward H.N.: A bound for divisible codes. IEEE Trans. Inform. Theory 38, 191\u2013194 (1992)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9380_CR6","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1006\/jcta.2000.3124","volume":"94","author":"H.N. Ward","year":"2001","unstructured":"Ward H.N.: The divisible code bound revisited. J. Combin. Theory A 94, 34\u201350 (2001)","journal-title":"J. Combin. Theory A"},{"key":"9380_CR7","doi-asserted-by":"crossref","first-page":"3154","DOI":"10.1016\/j.disc.2004.10.030","volume":"306","author":"R.M. Wilson","year":"2006","unstructured":"Wilson R.M.: A lemma on polynomials modulo p m and applications to coding theory. Discrete Math. 306, 3154\u20133165 (2006)","journal-title":"Discrete Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9380-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-010-9380-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9380-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:28Z","timestamp":1559246308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-010-9380-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,12]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["9380"],"URL":"https:\/\/doi.org\/10.1007\/s10623-010-9380-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,12]]}}}