{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:43:40Z","timestamp":1775054620871,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T00:00:00Z","timestamp":1656028800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T00:00:00Z","timestamp":1656028800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10623-022-01070-y","type":"journal-article","created":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T15:07:47Z","timestamp":1656083267000},"page":"1713-1719","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the number of q-ary quasi-perfect codes with covering radius 2"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1591-1096","authenticated-orcid":false,"given":"Alexander M.","family":"Romanov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,24]]},"reference":[{"key":"1070_CR1","first-page":"1269","volume-title":"Handbook of Coding Theory","author":"EF Assmus","year":"1998","unstructured":"Assmus E.F., Key J.D.: Polynomial codes and finite geometries. In: Pless V.S., Huffman W.C., Brualdi R.A. (eds.) Handbook of Coding Theory, vol. II, pp. 1269\u20131344. Elsevier, Amsterdam (1998)."},{"key":"1070_CR2","unstructured":"Delsarte P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl. 10 (1973)."},{"key":"1070_CR3","doi-asserted-by":"crossref","unstructured":"Delsarte P., Goethals J.M., MacWilliams F.J.: On generalized Reed-Muller codes and their relatives. Inf. Control 16, 403\u2013442 (1970).","DOI":"10.1016\/S0019-9958(70)90214-7"},{"key":"1070_CR4","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1109\/18.868484","volume":"46","author":"P Ding","year":"2000","unstructured":"Ding P., Key J.D.: Minimum-weight codewords as generators of generalized Reed-Muller codes. IEEE Trans. Inf. Theory 46, 2152\u20132157 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1070_CR5","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, 754\u2013763 (1994).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1070_CR6","first-page":"9","volume":"30","author":"JM Goethals","year":"1975","unstructured":"Goethals J.M., van Tilborg H.C.A.: Uniformly packed codes. Philips Res. Rep. 30, 9\u201336 (1975).","journal-title":"Philips Res. Rep."},{"key":"1070_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1109\/TIT.1968.1054127","volume":"14","author":"T Kasami","year":"1968","unstructured":"Kasami T., Lin S., Peterson W.W.: New generalizations of the Reed-Muller codes. Part I: primitive codes. IEEE Trans. Inf. Theory 14, 189\u2013199 (1968).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1070_CR8","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1109\/TIT.1968.1054226","volume":"14","author":"T Kasami","year":"1968","unstructured":"Kasami T., Lin S., Peterson W.W.: Polynomial codes. IEEE Trans. Inf. Theory 14, 807\u2013814 (1968).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1070_CR9","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)."},{"key":"1070_CR10","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. Algebraic Discret. Methods 5, 224\u2013228 (1984).","journal-title":"SIAM J. Algebraic Discret. Methods"},{"key":"1070_CR11","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$$-ary 1-perfect codes. Des. Codes Cryptogr. 27, 139\u2013144 (2002).","journal-title":"Des. Codes Cryptogr."},{"key":"1070_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1134\/S0032946021030017","volume":"57","author":"AM Romanov","year":"2021","unstructured":"Romanov A.M.: On perfect and Reed-Muller codes over finite fields. Probl. Inf. Transm. 57, 199\u2013211 (2021).","journal-title":"Probl. Inf. Transm."},{"key":"1070_CR13","unstructured":"van Tilborg H.C.A.: Uniformly packed codes. PhD Thesis, University of Tech., Eindhoven (1976)."},{"key":"1070_CR14","first-page":"337","volume":"8","author":"YuL Vasil\u2019ev","year":"1962","unstructured":"Vasil\u2019ev Yu.L.: On nongroup close-packed codes. Probl. Kybern. 8, 337\u2013339 (1962).","journal-title":"Probl. Kybern."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01070-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01070-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01070-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T19:26:06Z","timestamp":1659209166000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01070-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,24]]},"references-count":14,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["1070"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01070-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,24]]},"assertion":[{"value":"31 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}