{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T15:06:28Z","timestamp":1775055988186,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T00:00:00Z","timestamp":1528329600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10623-018-0506-1","type":"journal-article","created":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T06:49:29Z","timestamp":1528354169000},"page":"995-1003","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On non-full-rank perfect codes over finite fields"],"prefix":"10.1007","volume":"87","author":[{"given":"Alexander M.","family":"Romanov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,7]]},"reference":[{"issue":"1","key":"506_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10623-004-5659-4","volume":"38","author":"TL Alderson","year":"2006","unstructured":"Alderson T.L.: (6, 3)-MDS codes over an alphabet of size 4. Des. Codes Crypt. 38(1), 31\u201340 (2006).","journal-title":"Des. Codes Crypt."},{"key":"506_CR2","first-page":"272","volume":"27","author":"P Delsarte","year":"1972","unstructured":"Delsarte P.: Bounds for unrestricted codes, by linear programming. Philips Res. Rep. 27, 272\u2013289 (1972).","journal-title":"Philips Res. Rep."},{"issue":"3","key":"506_CR3","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1109\/18.335887","volume":"40","author":"T Etzion","year":"1994","unstructured":"Etzion T., Vardy A.: Perfect binary codes: constructions, properties, and enumeration. IEEE Trans. Inf. Theory 40(3), 754\u2013763 (1994).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"506_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1137\/S0895480196309171","volume":"11","author":"T Etzion","year":"1998","unstructured":"Etzion T., Vardy A.: On perfect codes and tilings: problems and solutions. SIAM J. Discrete Math. 11(2), 205\u2013223 (1998).","journal-title":"SIAM J. Discrete Math."},{"key":"506_CR5","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/S0019-9958(77)90372-2","volume":"34","author":"O Heden","year":"1977","unstructured":"Heden O.: A new construction of group and nongroup perfect codes. Inform. Control 34, 314\u2013323 (1977).","journal-title":"Inform. Control"},{"issue":"1","key":"506_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10623-007-9133-y","volume":"46","author":"O Heden","year":"2008","unstructured":"Heden O.: On perfect p-ary codes of length p + 1. Des. Codes Cryptogr. 46(1), 45\u201356 (2008).","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"506_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.3934\/amc.2011.5.149","volume":"5","author":"O Heden","year":"2011","unstructured":"Heden O., Krotov D.S.: On the structure of non-full-rank perfect $$q$$ q -ary codes. Adv. Math. Commun. 5(2), 149\u2013156 (2011).","journal-title":"Adv. Math. Commun."},{"issue":"11","key":"506_CR8","doi-asserted-by":"publisher","first-page":"1856","DOI":"10.1016\/j.disc.2015.04.014","volume":"338","author":"DS Krotov","year":"2015","unstructured":"Krotov D.S., Sotnikova E.V.: Embedding in $$q$$ q -ary 1-perfect codes and partitions. Discrete Math. 338(11), 1856\u20131859 (2015).","journal-title":"Discrete Math."},{"key":"506_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.7146\/math.scand.a-10952","volume":"25","author":"B Lindstr\u00f6m","year":"1969","unstructured":"Lindstr\u00f6m B.: On group and nongroup perfect codes in $$q$$ q symbols. Math. Scand. 25, 149\u2013158 (1969).","journal-title":"Math. Scand."},{"key":"506_CR10","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland Publishing Co., Amsterdam (1977)."},{"issue":"1","key":"506_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1137\/0607013","volume":"7","author":"M Mollard","year":"1986","unstructured":"Mollard M.: A generalized parity function and its use in the construction of perfect codes. SIAM J. Algebr. Discrete Methods 7(1), 113\u2013115 (1986).","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"6","key":"506_CR12","doi-asserted-by":"publisher","first-page":"2571","DOI":"10.1109\/TIT.2010.2046197","volume":"56","author":"PRJ \u00d6sterg\u00e5rd","year":"2010","unstructured":"\u00d6sterg\u00e5rd P.R.J., Pottonen O., Phelps K.T.: The perfect binary one-error-correcting codes of length 15: part II-properties. IEEE Trans. Inform. Theory 56(6), 2571\u20132582 (2010).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"506_CR13","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/0604040","volume":"4","author":"KT Phelps","year":"1983","unstructured":"Phelps K.T.: A combinatorial construction of perfect codes. SIAM J. Algebr. Discrete Methods 4, 398\u2013403 (1983).","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"2","key":"506_CR14","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/0605023","volume":"5","author":"KT Phelps","year":"1984","unstructured":"Phelps K.T.: A general product construction for error correcting codes. SIAM J. Algebr. Discrete Methods 5(2), 224\u2013228 (1984).","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"5","key":"506_CR15","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TIT.1984.1056963","volume":"30","author":"KT Phelps","year":"1984","unstructured":"Phelps K.T.: A product construction for perfect codes over arbitrary alphabets. IEEE Trans. Inf. Theory 30(5), 769\u2013771 (1984).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"506_CR16","first-page":"287","volume":"21","author":"KT Phelps","year":"2000","unstructured":"Phelps K.T.: An enumeration of 1-perfect binary codes. Aust. J. Comb. 21, 287\u2013298 (2000).","journal-title":"Aust. J. Comb."},{"issue":"2","key":"506_CR17","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1017150214026","volume":"16","author":"KT Phelps","year":"1999","unstructured":"Phelps K.T., LeVan M.J.: Switching equivalence classes of perfect codes. Des. Codes Cryptogr. 16(2), 179\u2013184 (1999).","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"506_CR18","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10623-004-3989-x","volume":"37","author":"KT Phelps","year":"2005","unstructured":"Phelps K.T., Rif\u00e0 J., Villanueva M.: Kernels and $$p$$ p -kernels of $$p^r$$ p r -ary 1-perfect codes. Des. Codes Cryptogr. 37(2), 243\u2013261 (2005).","journal-title":"Des. Codes Cryptogr."},{"issue":"1\u20132","key":"506_CR19","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1016510804974","volume":"27","author":"KT Phelps","year":"2002","unstructured":"Phelps K.T., Villanueva M.: Ranks of $$q$$ q -ary 1-perfect codes. Des. Codes Cryptogr. 27(1\u20132), 139\u2013144 (2002).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"506_CR20","doi-asserted-by":"crossref","first-page":"P65","DOI":"10.37236\/2158","volume":"19","author":"AM Romanov","year":"2012","unstructured":"Romanov A.M.: Hamiltonicity of minimum distance graphs of 1-perfect codes. Electron. J. Comb. 19(1), P65 (2012).","journal-title":"Electron. J. Comb."},{"issue":"3","key":"506_CR21","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1134\/S1990478916030157","volume":"10","author":"AM Romanov","year":"2016","unstructured":"Romanov A.M.: On full-rank perfect codes over finite fields. J. Appl. Indus. Math. 10(3), 444\u2013452 (2016).","journal-title":"J. Appl. Indus. Math."},{"key":"506_CR22","unstructured":"Romanov A.M.: On non-full-rank perfect codes over finite fields. In: Proceedings of International Conference \u201cMathematics in the Modern World\u201d, Novosibirsk, 14\u201319 August 2017, p. 473 (2017)."},{"key":"506_CR23","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0019-9958(68)90167-8","volume":"12","author":"J Sch\u00f6nheim","year":"1968","unstructured":"Sch\u00f6nheim J.: On linear and nonlinear single-error-correcting $$q$$ q -nary perfect codes. Inform. Control 12, 23\u201326 (1968).","journal-title":"Inform. Control"},{"key":"506_CR24","first-page":"65","volume":"37","author":"FI Solov\u2019eva","year":"1981","unstructured":"Solov\u2019eva F.I.: On binary nongroup codes. Methody Diskr. Anal. 37, 65\u201376 (1981).","journal-title":"Methody Diskr. Anal."},{"key":"506_CR25","first-page":"375","volume":"8","author":"JL Vasil\u2019ev","year":"1962","unstructured":"Vasil\u2019ev J.L.: On nongroup close-packed codes. Probl. Cybernet. 8, 375\u2013378 (1962).","journal-title":"Probl. Cybernet."},{"issue":"1","key":"506_CR26","first-page":"5","volume":"12","author":"VA Zinoviev","year":"1976","unstructured":"Zinoviev V.A.: Generalized concatenated codes. Probl. Inform. Transm. 12(1), 5\u201315 (1976).","journal-title":"Probl. Inform. Transm."},{"issue":"1","key":"506_CR27","first-page":"20","volume":"46","author":"VA Zinoviev","year":"2010","unstructured":"Zinoviev V.A., Zinoviev D.V.: Binary perfect and extended perfect codes of lengths $$15$$ 15 and $$16$$ 16 with ranks $$13$$ 13 and $$14$$ 14 . Probl. Inform. Transm. 46(1), 20\u201324 (2010).","journal-title":"Probl. Inform. Transm."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0506-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-018-0506-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0506-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,3]],"date-time":"2020-11-03T05:32:28Z","timestamp":1604381548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-018-0506-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,7]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["506"],"URL":"https:\/\/doi.org\/10.1007\/s10623-018-0506-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,7]]},"assertion":[{"value":"14 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}