{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:34:42Z","timestamp":1774370082509,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1023\/a:1017150214026","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T15:19:29Z","timestamp":1041175169000},"page":"179-184","source":"Crossref","is-referenced-by-count":14,"title":["Switching Equivalence Classes of Perfect Codes"],"prefix":"10.1007","volume":"16","author":[{"given":"Kevin T.","family":"Phelps","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"195208_CR1","unstructured":"S.V. Avgustinovich and F.I. Solov'eva, On projections of perfect binary codes, Proc. Seventh Joint Swedish-Russian Int. Workshop on Inform. Theory, St.-Petersburg, Russia (1995) pp. 25-26."},{"issue":"3","key":"195208_CR2","first-page":"258","volume":"32","author":"S.V. Avgustinovich","year":"1996","unstructured":"S.V. Avgustinovich and F.I. Solov'eva, On non-systematic perfect binary codes, Problems of Information Transmission, Vol. 32,No. 3 (1996), pp. 258-261","journal-title":"Problems of Information Transmission"},{"key":"195208_CR3","unstructured":"S.V. Avgustinovich and F.I. Solov'eva, Construction of perfect binary codes by the sequential translations of i-components, Proc. Fifth Int.Workshop on Algebraic and Comb. coding Theory, Sozopol, Bulgaria, (1996) pp. 9-13."},{"key":"195208_CR4","doi-asserted-by":"crossref","unstructured":"S.V. Avgustinovich, On a Property of Perfect Binary Codes, Operations Research and Discrete Analysis (1997) pp. 13-15.","DOI":"10.1007\/978-94-011-5678-3_2"},{"key":"195208_CR5","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1109\/18.335887","volume":"40","author":"T. Etzion","year":"1994","unstructured":"T. Etzion and A. Vardy, Perfect codes: constructions, properties and enumeration, IEEE Trans. Inform. Theory, Vol. 40 (1994) pp. 754-763.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"195208_CR6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01388453","volume":"4","author":"O. Heden","year":"1994","unstructured":"O. Heden, A binary perfect code of length 15 and codimension 0, Des. Codes and Cryptogr., Vol. 4 (1994) pp. 213-220.","journal-title":"Des. Codes and Cryptogr."},{"key":"195208_CR7","first-page":"3","volume":"15","author":"R.A. Mathon","year":"1983","unstructured":"R.A. Mathon, K.T. Phelps and A. Rosa, Small Steiner triple systems and their properties, Ars Combinat., Vol. 15 (1983) pp. 3-110.","journal-title":"Ars Combinat."},{"key":"195208_CR8","first-page":"45","volume":"30","author":"B. D. McKay","year":"1981","unstructured":"B. D. McKay, Practical graph isomorphism, Congressus Numerantium, Vol. 30 (1981) pp. 45-87.","journal-title":"Congressus Numerantium"},{"key":"195208_CR9","unstructured":"B. D. McKay, Nauty User's Guide, (version 1.5) http:\/\/cs.anu.edu.au\/people\/bdm\/."},{"key":"195208_CR10","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1137\/0604040","volume":"5","author":"K.T. Phelps","year":"1983","unstructured":"K.T. Phelps, A combinatorial construction of perfect codes, SIAM J. Alg. Disc. Meth., Vol. 5 (1983) pp. 398-403.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"195208_CR11","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01388478","volume":"6","author":"K.T. Phelps","year":"1995","unstructured":"K.T. Phelps and M. LeVan, Kernels of nonlinear Hamming codes, Des. Codes and Cryptogr., Vol. 6 (1995) pp. 247-257.","journal-title":"Des. Codes and Cryptogr."},{"key":"195208_CR12","first-page":"65","volume":"37","author":"F.I. Solov'eva","year":"1981","unstructured":"F.I. Solov'eva, On binary nongroup codes, Methody Diskr. Analiza, Vol. 37 (1981) pp. 65-76 (in Russian).","journal-title":"Methody Diskr. Analiza"},{"key":"195208_CR13","first-page":"66","volume":"47","author":"F.I. Solov'eva","year":"1988","unstructured":"F.I. Solov'eva, Factorization of code generating d.n.f., Methody Diskr. Analiza, Vol. 47 (1988) pp. 66-88 (in Russian).","journal-title":"Methody Diskr. Analiza"},{"key":"195208_CR14","first-page":"15","volume-title":"Exact Bounds on the Connectivity of Code-Generated Disjunctive Normal Forms","author":"F.I. Solov'eva","year":"1990","unstructured":"F.I. Solov'eva, Exact Bounds on the Connectivity of Code-Generated Disjunctive Normal Forms, Inst. Math. of the Siberian Branch of Acad. of Sciences, USSR, Preprint 10 (1990) pp. 15, (in Russian)."},{"key":"195208_CR15","first-page":"375","volume":"8","author":"Y.L. Vasil'ev","year":"1965","unstructured":"Y.L. Vasil'ev, On nongroup close-packed codes, Probleme der Kibernetik, Vol. 8 (1965) pp. 375-378 92\u201395.","journal-title":"Probleme der Kibernetik"},{"key":"195208_CR16","unstructured":"Y.L. Vasil'ev and F.I. Solov'eva, Interdependence between perfect binary codes and their projections, Proc. Seventh Joint Swedish-Russian Int.Workshop on Inform. Theory, St.-Petersburg, Russia (1995) pp. 239-242."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1017150214026.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1017150214026\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1017150214026.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:18:33Z","timestamp":1753759113000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1017150214026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["195208"],"URL":"https:\/\/doi.org\/10.1023\/a:1017150214026","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}