{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:29:31Z","timestamp":1775017771676,"version":"3.50.1"},"reference-count":28,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1134\/s0032946022040032","type":"journal-article","created":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T12:06:06Z","timestamp":1673352366000},"page":"306-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On One Construction Method for Hadamard Matrices"],"prefix":"10.1134","volume":"58","author":[{"given":"M.","family":"Villanueva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. A.","family":"Zinoviev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. A.","family":"Zinoviev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2023,1,10]]},"reference":[{"key":"5062_CR1","doi-asserted-by":"publisher","unstructured":"No, J.-S. and Song, H.-Y., Generalized Sylvester-Type Hadamard Matrices, in Proc. 2000 IEEE Int. Symp. on Information Theory (ISIT\u20192000), Sorrento, Italy, June 25\u201330, 2000, p. 472. https:\/\/doi.org\/10.1109\/ISIT.2000.866770","DOI":"10.1109\/ISIT.2000.866770"},{"issue":"2","key":"5062_CR2","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/18.312154","volume":"40","author":"AR Hammons","year":"1970","unstructured":"Hammons, A.R., Jr., Kumar, P.V., Calderbank, A.R., Sloane, N.J.A., and Sol\u00e9, P., The $$\\mathbb{Z}_4$$-Linearity of Kerdock, Preparata, Goethals, and Related Codes, IEEE Trans. Inform. Theory, 1994, vol.\u00a040, no.\u00a02, pp.\u00a0301\u2013319. https:\/\/doi.org\/10.1109\/18.312154","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"5062_CR3","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1109\/18.681328","volume":"44","author":"C Carlet","year":"1998","unstructured":"Carlet, C., $$\\mathbb{Z}_{2^k}$$-Linear Codes,  IEEE Trans. Inform. Theory, 1998, vol.\u00a044, no.\u00a04, pp.\u00a01543\u20131547. https:\/\/doi.org\/10.1109\/18.681328","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5062_CR4","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/S1571-0653(04)00370-1","volume":"10","author":"C Fern\u00e1ndez","year":"2001","unstructured":"Fern\u00e1ndez, C., Rif\u00e0, J., and Borges, J., Every $$\\mathbb{Z}_{2k}$$-Code is a Binary Propelinear Code, Electron. Notes Discrete Math., 2001, vol.\u00a010, pp.\u00a0100\u2013102. https:\/\/doi.org\/10.1016\/S1571-0653(04)00370-1","journal-title":"Electron. Notes Discrete Math."},{"issue":"4","key":"5062_CR5","doi-asserted-by":"publisher","first-page":"571","DOI":"10.3934\/amc.2011.5.571","volume":"5","author":"ST Dougherty","year":"2011","unstructured":"Dougherty, S.T. and Fern\u00e1ndez-C\u00f3rdoba, C., Codes over $$\\mathbb{Z}_{2^ k}$$, Gray Map and Self-Dual Codes, Adv. Math. Commun., 2011, vol.\u00a05, no.\u00a04, pp.\u00a0571\u2013588. https:\/\/doi.org\/10.3934\/amc.2011.5.571","journal-title":"Adv. Math. Commun."},{"issue":"4","key":"5062_CR6","doi-asserted-by":"publisher","first-page":"1532","DOI":"10.1109\/TIT.2007.892787","volume":"53","author":"DS Krotov","year":"2007","unstructured":"Krotov, D.S., On $$\\mathbb{Z}_{2^k}$$-Dual Binary Codes, IEEE Trans. Inform. Theory, 2007, vol.\u00a053, no.\u00a04, pp.\u00a01532\u20131537. https:\/\/doi.org\/10.1109\/TIT.2007.892787","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2-3","key":"5062_CR7","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10623-018-0546-6","volume":"87","author":"C Fern\u00e1ndez-C\u00f3rdoba","year":"2019","unstructured":"Fern\u00e1ndez-C\u00f3rdoba, C., Vela, C., and Villanueva, M., On $$\\mathbb{Z}_{2^s}$$-Linear Hadamard Codes: Kernel and Partial Classification, Des. Codes Cryptogr., 2019, vol.\u00a087, no.\u00a02\u20133, pp.\u00a0417\u2013435. https:\/\/doi.org\/10.1007\/s10623-018-0546-6","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"5062_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF02579339","volume":"3","author":"H Bauer","year":"1983","unstructured":"Bauer, H., Ganter, B., and Hergert, F., Algebraic Techniques for Nonlinear Codes, Combinatorica, 1983, vol.\u00a03, no.\u00a01, pp.\u00a021\u201333. https:\/\/doi.org\/10.1007\/BF02579339","journal-title":"Combinatorica"},{"key":"5062_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316529836","volume-title":"Designs and Their Codes","author":"EF Assmus","year":"1992","unstructured":"Assmus, E.F., Jr. and Key, J.D., Designs and Their Codes, Cambridge: Cambridge Univ. Press, 1992."},{"issue":"1-3","key":"5062_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0012-365X(94)90024-8","volume":"133","author":"H Kimura","year":"1994","unstructured":"Kimura, H., Classfication of Hadamard Matrices of Order 28, Discrete Math., 1994, vol.\u00a0133, no.\u00a01\u20133, pp.\u00a0171\u2013180. https:\/\/doi.org\/10.1016\/0012-365X(94)90024-8","journal-title":"Discrete Math."},{"issue":"5","key":"5062_CR11","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1002\/jcd.20245","volume":"18","author":"H Kharaghani","year":"2010","unstructured":"Kharaghani, H. and Tayfeh-Rezaie, B., On the Classification of Hadamard Matrices of Order 32, J.\u00a0Combin. Des., 2010, vol.\u00a018, no.\u00a05, pp.\u00a0328\u2013336. https:\/\/doi.org\/10.1002\/jcd.20245","journal-title":"J. Combin. Des."},{"issue":"5","key":"5062_CR12","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1002\/jcd.21323","volume":"21","author":"H Kharaghani","year":"2013","unstructured":"Kharaghani, H. and Tayfeh-Rezaie, B., Hadamard Matrices of Order 32, J.\u00a0Combin. Des., 2013, vol.\u00a021, no.\u00a05, pp.\u00a0212\u2013221. https:\/\/doi.org\/10.1002\/jcd.21323","journal-title":"J. Combin. Des."},{"issue":"2","key":"5062_CR13","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1109\/TIT.2019.2952599","volume":"66","author":"C Fern\u00e1ndez-C\u00f3rdoba","year":"2020","unstructured":"Fern\u00e1ndez-C\u00f3rdoba, C., Vela, C., and Villanueva, M., On $$\\mathbb{Z}_8$$-Linear Hadamard Codes: Rank and Classification, IEEE Trans. Inform. Theory, 2020, vol.\u00a066, no.\u00a02, pp.\u00a0970\u2013982. https:\/\/doi.org\/10.1109\/TIT.2019.2952599","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"5062_CR14","doi-asserted-by":"publisher","first-page":"111721","DOI":"10.1016\/j.disc.2019.111721","volume":"343","author":"C Fern\u00e1ndez-C\u00f3rdoba","year":"2020","unstructured":"Fern\u00e1ndez-C\u00f3rdoba, C., Vela, C., and Villanueva, M., Equivalences among $$\\mathbb{Z}_{2^s}$$-Linear Hadamard Codes, Discrete Math., 2020, vol.\u00a0343, no.\u00a03. Art. 111721 (13\u00a0pp.). https:\/\/doi.org\/10.1016\/j.disc.2019.111721","journal-title":"Discrete Math."},{"issue":"11","key":"5062_CR15","doi-asserted-by":"publisher","first-page":"3931","DOI":"10.1109\/TIT.2005.856940","volume":"51","author":"KT Phelps","year":"2005","unstructured":"Phelps, K.T., Rif\u00e0, J., and Villanueva, M., Rank and Kernel of Binary Hadamard Codes, IEEE Trans. Inform. Theory, 2005, vol.\u00a051, no.\u00a011, pp.\u00a03931\u20133937. https:\/\/doi.org\/10.1109\/TIT.2005.856940","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5062_CR16","doi-asserted-by":"publisher","unstructured":"Phelps, K.T., Rif\u00e0, J., and Villanueva, M., Hadamard Codes of Length $$2^ts$$ ($$s$$ Odd). Rank and Kernel, Proc. 16th Int. Symp. on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-16), Las Vegas, NV, USA, Feb.\u00a020\u201324, 2006, Fossorier,\u00a0M., Imai,\u00a0H., Lin,\u00a0S., and Poli,\u00a0A., Eds., Lect. Notes Comput. Sci., vol.\u00a03857, Berlin: Springer, 2006, pp.\u00a0328\u2013337. https:\/\/doi.org\/10.1007\/11617983_32","DOI":"10.1007\/11617983_32"},{"issue":"1","key":"5062_CR17","first-page":"5","volume":"12","author":"VA Zinoviev","year":"1976","unstructured":"Zinoviev, V.A., Generalized Concatenated Codes, Probl. Peredachi Inf., 1976, vol.\u00a012, no.\u00a01, pp.\u00a05\u201315 [Probl. Inf. Transm. (Engl. Transl.), 1976, vol.\u00a012, no.\u00a01, pp.\u00a02\u20139]. http:\/\/mi.mathnet.ru\/eng\/ppi1670","journal-title":"Probl. Peredachi Inf."},{"issue":"1","key":"5062_CR18","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1109\/18.370114","volume":"41","author":"T Ericson","year":"1995","unstructured":"Ericson, T. and Zinoviev, V., Spherical Codes Generated by Binary Partitions of Symmetric Pointsets, IEEE Trans. Inform. Theory, 1995, vol.\u00a041, no.\u00a01, pp.\u00a0107\u2013129. https:\/\/doi.org\/10.1109\/18.370114","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"5062_CR19","first-page":"40","volume":"49","author":"VA Zinoviev","year":"2013","unstructured":"Zinoviev, V.A. and Zinoviev, D.V., Structure of Steiner Triple Systems $$S(2^m-1,3,2)$$ of Rank $$2^m-m+2$$ over $$\\mathbb{F}_2$$, Probl. Peredachi Inf., 2013, vol.\u00a049, no.\u00a03, pp.\u00a040\u201356 [Probl. Inf. Transm. (Engl. Transl.), 2013, vol.\u00a049, no.\u00a03, pp.\u00a0232\u2013248]. http:\/\/mi.mathnet.ru\/eng\/ppi2115","journal-title":"Probl. Peredachi Inf."},{"key":"5062_CR20","unstructured":"Zinoviev, D.V. and Zinoviev, V.A., On Generalized Concatenated Construction of Codes in Metrics Lee $$L$$ and $$L_1$$, in Proc. 16th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT\u20192018), Svetlogorsk (Kaliningrad region), Russia, Sept.\u00a02\u20138, 2018, pp.\u00a062\u201365. Available at https:\/\/www.dropbox.com\/s\/h7u89lh8vyirww9."},{"issue":"1","key":"5062_CR21","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1134\/S003294602101004X","volume":"57","author":"VA Zinoviev","year":"2021","unstructured":"Zinoviev, V.A. and Zinoviev, D.V., On the Generalized Concatenated Construction for Codes in $$L_1$$ and Lee Metrics, Probl. Peredachi Inf., 2021, vol.\u00a057, no.\u00a01, pp.\u00a081\u201395 [Probl. Inf. Transm. (Engl. Transl.), 2021, vol.\u00a057, no.\u00a01, pp.\u00a070\u201383]. https:\/\/doi.org\/10.1134\/S003294602101004X","journal-title":"Probl. Peredachi Inf."},{"issue":"2","key":"5062_CR22","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1109\/TIT.2014.2379644","volume":"61","author":"DS Krotov","year":"2015","unstructured":"Krotov, D.S. and Villanueva, M., Classification of the $$\\mathbb{Z}_2\\mathbb{Z}_4$$-Linear Hadamard Codes and Their Automorphism Groups, IEEE Trans. Inform. Theory, 2015, vol.\u00a061, no.\u00a02, pp.\u00a0887\u2013894. https:\/\/doi.org\/10.1109\/TIT.2014.2379644","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5062_CR23","unstructured":"Handbook of Magma Functions, Bosma,\u00a0W., Cannon,\u00a0J.J., Fieker,\u00a0C., and Steel,\u00a0A., Eds., Edition 2.26-4, 2021. Available at http:\/\/magma.maths.usyd.edu.au\/magma\/handbook\/"},{"issue":"1-4","key":"5062_CR24","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1002\/sapm1933121321","volume":"12","author":"JA Todd","year":"1933","unstructured":"Todd, J.A., A Combinatorial Problem, J.\u00a0Math. Phys. Camb., 1933, vol.\u00a012, no.\u00a01\u20134, pp.\u00a0321\u2013333. https:\/\/doi.org\/10.1002\/sapm1933121321","journal-title":"J. Math. Phys. Camb."},{"issue":"10.1","key":"5062_CR25","first-page":"21","volume":"36","author":"M Hall","year":"1961","unstructured":"Hall, M., Jr., Hadamard Matrices of Order 16, JPL Research Summary, 1961, no.\u00a036-10.1, pp.\u00a021\u201326.","journal-title":"JPL Research Summary"},{"key":"5062_CR26","unstructured":"Hall, M., Jr., Hadamard Matrices of Order 20, JPL Tech. Rep., 1965, no.\u00a032-761."},{"key":"5062_CR27","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF01788676","volume":"5","author":"H Kimura","year":"1989","unstructured":"Kimura, H., New Hadamard Matrix of Order 24, Graphs Combin., 1989, vol.\u00a05, pp.\u00a0235\u2013242. https:\/\/doi.org\/10.1007\/BF01788676","journal-title":"Graphs Combin."},{"key":"5062_CR28","unstructured":"A Library of Hadamard Matrices (online library; maintained by Sloane, N.J.A.), http:\/\/neilsloane.com\/hadamard\/"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946022040032.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946022040032","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946022040032.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:48:12Z","timestamp":1775011692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946022040032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["5062"],"URL":"https:\/\/doi.org\/10.1134\/s0032946022040032","relation":{"is-translation-of":[{"id-type":"doi","id":"10.31857\/S0555292322040039","asserted-by":"subject"}]},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10]]},"assertion":[{"value":"7 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}