{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T03:01:05Z","timestamp":1705460465156},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4307,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0166-218x(00)00376-0","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:12:20Z","timestamp":1034593940000},"page":"289-294","source":"Crossref","is-referenced-by-count":2,"title":["Cyclic distance-preserving codes on a constant-weight basis"],"prefix":"10.1016","volume":"114","author":[{"given":"A.J.","family":"van Zanten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00376-0_BIB1","unstructured":"A.A. Evdokimov, On numeration of subsets of a finite set, Methods of discrete analysis in a solution of the combinatorial problems, Sb. trudov Inst. Mat. SO AN SSSR 34 (1980) pp. 8\u201326 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00376-0_BIB2","unstructured":"A.A. Evdokimov, Metric properties of embeddings, and the codes preserving distances, Modely i Metody Optimizatsii, Trudy Sobolev Inst. Mat. 10 (1988), Novosibirsk, 116\u2013132 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00376-0_BIB3","unstructured":"A.L. Perezhogin, On locally isometric coding of natural numbers, Diskret. Anal. Issled. Oper. 3(4) (1996) 69\u201376 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00376-0_BIB4","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TIT.1974.1055267","article-title":"Difference-preserving codes","volume":"IT-20","author":"Preparata","year":"1974","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(00)00376-0_BIB5","doi-asserted-by":"crossref","first-page":"1988","DOI":"10.1109\/18.265509","article-title":"Minimal-change order and separability in linear codes","volume":"IT-39","author":"van Zanten","year":"1993","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(00)00376-0_BIB6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1023\/A:1008393130864","article-title":"A. Lukito, Construction of certain distance-preserving codes having linear-algebraic characteristics","volume":"16","author":"van Zanten","year":"1999","journal-title":"Designs, Codes Cryptogr."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003760?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003760?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T16:25:33Z","timestamp":1556209533000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166218X00003760"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00376-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}