{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T20:18:51Z","timestamp":1648930731231},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,10,1]],"date-time":"2005-10-01T00:00:00Z","timestamp":1128124800000},"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,10]]},"DOI":"10.1007\/s10623-004-3802-x","type":"journal-article","created":{"date-parts":[[2005,8,16]],"date-time":"2005-08-16T18:03:06Z","timestamp":1124215386000},"page":"15-29","source":"Crossref","is-referenced-by-count":6,"title":["On the Construction of Linear q-ary Lexicodes"],"prefix":"10.1007","volume":"37","author":[{"given":"A. J. van","family":"Zanten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I Nengah","family":"Suparta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3802_CR1","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/A:1027385806430","volume":"9","author":"JT. Bonn","year":"1996","journal-title":"Designs, Codes and Crypthography."},{"key":"3802_CR2","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0097-3165(93)90085-M","volume":"64","author":"R.A. Brualdi","year":"1993","journal-title":"Journal of Combinatorial Theory Series A,"},{"key":"3802_CR3","doi-asserted-by":"crossref","unstructured":"Conway J.H., Sloane N.J.A. (1986). Lexicographic codes: Error-correcting codes from game theory. IEEE Transaction Information Theory, IT-32, No. 3 337\u2013348","DOI":"10.1109\/TIT.1986.1057187"},{"key":"3802_CR4","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0012-365X(90)90008-6","volume":"83","author":"JH. Conway","year":"1990","journal-title":"Discrete Mathematics."},{"issue":"13","key":"3802_CR5","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1049\/el:19700293","volume":"6","author":"PG. Farrell","year":"1970","journal-title":"Electronics Letters."},{"key":"3802_CR6","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1006\/jcta.1996.0096","volume":"76","author":"D. Fon-Der-Flaass","year":"1996","journal-title":"Journal of Combinatorial Theory Series A."},{"key":"3802_CR7","first-page":"368","volume":"1","author":"VI. Levenstein","year":"1960","journal-title":"Doklady Akademii Nauk."},{"key":"3802_CR8","volume-title":"The Theory of Error-correcting Codes","author":"F.J. MacWilliams","year":"1988"},{"key":"3802_CR9","first-page":"649","volume":"31","author":"CL. Mallows","year":"1976","journal-title":"Journal of Appled Mathematics."},{"key":"3802_CR10","first-page":"49","volume":"104","author":"L. Monroe","year":"1994","journal-title":"Congressus Numerantium."},{"key":"3802_CR11","unstructured":"Monroe L. (1995). Greedy Codes over Binary and Non-binary Fields, Ph.D. thesis, University of Illinois at Chicago"},{"key":"3802_CR12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1023\/A:1027394008247","volume":"9","author":"L. Monroe","year":"1996","journal-title":"Designs, Codes and Crypthography."},{"key":"3802_CR13","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0021-9800(68)80067-5","volume":"5","author":"VS. Pless","year":"1968","journal-title":"Journal of Combinatorial Theory."},{"key":"3802_CR14","volume-title":"Handbook of Coding Theory, I","year":"1998"},{"issue":"1","key":"3802_CR15","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1109\/18.971740","volume":"48","author":"A. Trachtenberg","year":"2002","journal-title":"IEEE Transaction Information Theory."},{"key":"3802_CR16","unstructured":"van Zanten A.J. Lexicodes over fields of characteristic 2, rept. 93\u2013126, Faculty of Technical Mathematics and Informatics, Delft Universites of Techology, Delft, The Netherlands (1993)"},{"key":"3802_CR17","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1023\/A:1008244404559","volume":"10","author":"A.J. Zanten van","year":"1997","journal-title":"Designs, Codes and Cryptography."},{"key":"3802_CR18","volume-title":"An algorithm for a large class of linear q-ary lexicodes, rept. CS 03\u201301, Institute for Knowledge and Agent Technology","author":"A.J. Zanten van","year":"2003"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-004-3802-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-004-3802-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-004-3802-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:50:03Z","timestamp":1559231403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-004-3802-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,10]]}},"alternative-id":["3802"],"URL":"https:\/\/doi.org\/10.1007\/s10623-004-3802-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10]]}}}