乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T23:39:01Z","timestamp":1720222741340},"reference-count":33,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["14-11-00555"],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1016\/j.disc.2017.06.016","type":"journal-article","created":{"date-parts":[[2017,7,8]],"date-time":"2017-07-08T22:01:02Z","timestamp":1499551262000},"page":"2559-2572","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["The extended 1-perfect trades in small hypercubes"],"prefix":"10.1016","volume":"340","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-8516-755X","authenticated-orcid":false,"given":"Denis S.","family":"Krotov","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.disc.2017.06.016_b1","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/B:DESI.0000015891.01562.c1","article-title":"The classification of some perfect codes","volume":"31","author":"Avgustinovich","year":"2004","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"10.1016\/j.disc.2017.06.016_b2","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1002\/jcd.20207","article-title":"Embedding in a perfect code","volume":"17","author":"Avgustinovich","year":"2009","journal-title":"J. Combin. Des."},{"issue":"6","key":"10.1016\/j.disc.2017.06.016_b3","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1109\/TIT.1980.1056269","article-title":"Binary codes with a minimum distance of four","volume":"26","author":"Best","year":"1980","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.disc.2017.06.016_b4","series-title":"Distance-Regular Graphs","author":"Brouwer","year":"1989"},{"issue":"1","key":"10.1016\/j.disc.2017.06.016_b5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.2307\/2370885","article-title":"Configurations of rank two","volume":"53","author":"Carmichael","year":"1931","journal-title":"Am. J. Math."},{"issue":"6","key":"10.1016\/j.disc.2017.06.016_b6","doi-asserted-by":"crossref","first-page":"691","DOI":"10.2478\/s12175-008-0103-2","article-title":"The theory and application of latin bitrades: A survey","volume":"58","author":"Cavenagh","year":"2008","journal-title":"Math. Slovaca"},{"key":"10.1016\/j.disc.2017.06.016_b7","first-page":"75","article-title":"Configurations and trades in Steiner triple systems","volume":"29","author":"Forbes","year":"2004","journal-title":"Aust. J. Comb."},{"key":"10.1016\/j.disc.2017.06.016_b8","series-title":"Handbook of Combinatorial Designs","first-page":"644","article-title":"Trades","author":"Hedayat","year":"2006"},{"issue":"2","key":"10.1016\/j.disc.2017.06.016_b9","doi-asserted-by":"crossref","first-page":"223","DOI":"10.3934\/amc.2008.2.223","article-title":"A survey of perfect codes","volume":"2","author":"Heden","year":"2008","journal-title":"Adv. Math. Commun."},{"issue":"2","key":"10.1016\/j.disc.2017.06.016_b10","doi-asserted-by":"crossref","first-page":"149","DOI":"10.3934\/amc.2011.5.149","article-title":"On the structure of non-full-rank perfect q-ary codes","volume":"5","author":"Heden","year":"2011","journal-title":"Adv. Math. Commun."},{"key":"10.1016\/j.disc.2017.06.016_b11","series-title":"(dissertation)","article-title":"Algebraische methoden f\u00fcr nichtlineare codes","author":"Hergert","year":"1985"},{"key":"10.1016\/j.disc.2017.06.016_b12","series-title":"Algorithms Comput. Math., vol. 15","article-title":"Classification Algorithms for Codes and Designs","author":"Kaski","year":"2006"},{"issue":"3","key":"10.1016\/j.disc.2017.06.016_b13","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0097-3165(74)90054-5","article-title":"Intersections among Steiner systems","volume":"16","author":"Kramer","year":"1974","journal-title":"J. Combin. Theory, Ser. A"},{"issue":"2","key":"10.1016\/j.disc.2017.06.016_b14","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10623-009-9360-5","article-title":"On the binary codes with parameters of doubly-shortened 1-perfect codes","volume":"57","author":"Krotov","year":"2010","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"10.1016\/j.disc.2017.06.016_b15","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10623-011-9574-1","article-title":"On the binary codes with parameters of triply-shortened 1-perfect codes","volume":"64","author":"Krotov","year":"2012","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"10.1016\/j.disc.2017.06.016_b16","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.disc.2015.11.002","article-title":"To the theory of q-ary Steiner and Other-Type Trades","volume":"339","author":"Krotov","year":"2016","journal-title":"Discrete Math."},{"issue":"5","key":"10.1016\/j.disc.2017.06.016_b17","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1109\/18.333896","article-title":"The uniqueness of the best code","volume":"40","author":"Litsyn","year":"1994","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.disc.2017.06.016_b18","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/j.disc.2017.06.016_b19","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","article-title":"Practical graph isomorphism, II","volume":"60","author":"McKay","year":"2014","journal-title":"J. Symbolic Comput."},{"issue":"3","key":"10.1016\/j.disc.2017.06.016_b20","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1016\/j.disc.2011.05.016","article-title":"Switching codes and designs","volume":"312","author":"\u00d6sterg\u00e5rd","year":"2012","journal-title":"Discrete Math."},{"issue":"6","key":"10.1016\/j.disc.2017.06.016_b21","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1002\/jcd.20122","article-title":"There exist Steiner triple systems of order 15 that do not occur in a perfect binary one-error-correcting code","volume":"15","author":"\u00d6sterg\u00e5rd","year":"2007","journal-title":"J. Comb. Des."},{"issue":"2","key":"10.1016\/j.disc.2017.06.016_b22","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1137\/0605023","article-title":"A general product construction for error correcting codes","volume":"5","author":"Phelps","year":"1984","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"1","key":"10.1016\/j.disc.2017.06.016_b23","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1134\/S003294601201005X","article-title":"Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes","volume":"48","author":"Potapov","year":"2012","journal-title":"Probl. Inf. Transm."},{"issue":"2","key":"10.1016\/j.disc.2017.06.016_b24","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1134\/S0037446613020146","article-title":"Multidimensional latin bitrades","volume":"54","author":"Potapov","year":"2013","journal-title":"Sib. Math. J."},{"issue":"2","key":"10.1016\/j.disc.2017.06.016_b25","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1134\/S1990478908020105","article-title":"Survey of the methods for constructing nonlinear perfect binary codes","volume":"2","author":"Romanov","year":"2008","journal-title":"J. Appl. Ind. Math."},{"key":"10.1016\/j.disc.2017.06.016_b26","series-title":"Numbers, Information and Complexity","first-page":"311","article-title":"Switchings and perfect codes","author":"Solov\u2019eva","year":"2000"},{"issue":"1\u20132","key":"10.1016\/j.disc.2017.06.016_b27","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0166-218X(00)00352-8","article-title":"Structure of i-components of perfect binary codes","volume":"111","author":"Solov\u2019eva","year":"2001","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2017.06.016_b28","unstructured":"W.A. Stein, et al., Sage Mathematics Software (Version 6.9), The Sage Development Team, 2015, http:\/\/www.sagemath.org"},{"key":"10.1016\/j.disc.2017.06.016_b29","series-title":"Handbook of Combinatorial Designs","first-page":"474","article-title":"Trades and defining sets","author":"Street","year":"1996"},{"issue":"3","key":"10.1016\/j.disc.2017.06.016_b30","first-page":"11","article-title":"On mobile sets in the binary hypercube","volume":"15","author":"Vasil\u2019ev","year":"2008","journal-title":"Diskretn. Anal. Issled. Oper."},{"issue":"1","key":"10.1016\/j.disc.2017.06.016_b31","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1134\/S1990478915010159","article-title":"Bounds for the size of a minimal 1-perfect bitrade in a Hamming Graph","volume":"9","author":"Vorob\u2019ev","year":"2015","journal-title":"J. Appl. Ind. Math."},{"issue":"1","key":"10.1016\/j.disc.2017.06.016_b32","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02948948","article-title":"\u00dcber Steinersche systeme","volume":"12","author":"Witt","year":"1937","journal-title":"Abh. Math. Semin. Univ. Hambg."},{"issue":"1","key":"10.1016\/j.disc.2017.06.016_b33","first-page":"2","article-title":"Generalized concatenated codes","volume":"12","author":"Zinoviev","year":"1976","journal-title":"Probl. Inf. Transm."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X17301942?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X17301942?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T11:41:34Z","timestamp":1575373294000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X17301942"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":33,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["S0012365X17301942"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2017.06.016","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2017,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The extended 1-perfect trades in small hypercubes","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2017.06.016","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}