{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:42:03Z","timestamp":1775018523227,"version":"3.50.1"},"reference-count":15,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"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":[[2024,12]]},"DOI":"10.1134\/s003294602404001x","type":"journal-article","created":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T13:42:56Z","timestamp":1738417376000},"page":"273-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Constructions of Regular Hadamard Matrices and Bent Functions"],"prefix":"10.1134","volume":"60","author":[{"given":"J.","family":"Rif\u00e0","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Villanueva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. V.","family":"Zinoviev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. A.","family":"Zinoviev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2025,2,1]]},"reference":[{"key":"5105_CR1","unstructured":"Beth, T., Jungnickel, D., and Lenz, H., Design Theory, Cambridge, UK: Cambridge Univ. Press, 1986."},{"issue":"11","key":"5105_CR2","doi-asserted-by":"publisher","first-page":"3931","DOI":"10.1109\/TIT.2005.856940","volume":"51","author":"K.T. 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"},{"issue":"1","key":"5105_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0097-3165(73)90031-9","volume":"15","author":"R.L. McFarland","year":"1973","unstructured":"McFarland, R.L., A Family of Difference Sets in Non-cyclic Groups, J. Combin. Theory Ser. A, 1973, vol.\u00a015, no.\u00a01, pp.\u00a01\u201310. https:\/\/doi.org\/10.1016\/0097-3165(73)90031-9","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"5105_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0019-9958(59)90376-6","volume":"2","author":"R.C. Bose","year":"1959","unstructured":"Bose, R.C. and Shrikhande, S.S., A Note on a Result in the Theory of Code Construction, Inform. Control, 1959, vol.\u00a02, no.\u00a02, pp.\u00a0183\u2013194. https:\/\/doi.org\/10.1016\/S0019-9958(59)90376-6","journal-title":"Inform. Control"},{"issue":"5","key":"5105_CR5","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1090\/S0002-9939-1962-0142471-0","volume":"13","author":"P. Kesava Menon","year":"1962","unstructured":"Kesava Menon, P., On Difference Sets Whose Parameters Satisfy a Certain Relation, Proc. Amer. Math. Soc., 1962, vol.\u00a013, no.\u00a05, pp.\u00a0739\u2013745. https:\/\/doi.org\/10.1090\/S0002-9939-1962-0142471-0","journal-title":"Proc. Amer. Math. Soc."},{"issue":"4","key":"5105_CR6","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1090\/S0002-9939-1950-0036732-5","volume":"1","author":"H.J. Ryser","year":"1950","unstructured":"Ryser, H.J., A Note on a Combinatorial Problem, Proc. Amer. Math. Soc., 1950, vol.\u00a01, no.\u00a04, pp.\u00a0422\u2013424. https:\/\/doi.org\/10.1090\/S0002-9939-1950-0036732-5","journal-title":"Proc. Amer. Math. Soc."},{"issue":"1\u20132","key":"5105_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10623-012-9713-3","volume":"70","author":"J. Borges","year":"2014","unstructured":"Borges, J., Rif\u00e0, J., and Zinoviev, V.A., New Families of Completely Regular Codes and Their Corresponding Distance Regular Coset Graphs, Des. Codes Cryptogr., 2014, vol.\u00a070, no.\u00a01\u20132, pp.\u00a0139\u2013148. https:\/\/doi.org\/10.1007\/s10623-012-9713-3","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"5105_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.17323\/1609-4514-2023-23-1-121-128","volume":"23","author":"J. Rif\u00e0","year":"2023","unstructured":"Rif\u00e0, J. and Zinoviev, V.A., On Binary Quadratic Symmetric Bent and Semi-Bent Functions, Mosc. Math. J., 2023, vol.\u00a023, no.\u00a01, pp.\u00a0121\u2013128. https:\/\/doi.org\/10.17323\/1609-4514-2023-23-1-121-128","journal-title":"Mosc. Math. J."},{"issue":"4","key":"5105_CR9","first-page":"233","volume":"3","author":"D.B. Meisner","year":"1992","unstructured":"Meisner, D.B., On a Construction of Regular Hadamard Matrices, Atti Accad. Naz. Lincei Cl. Sci. Fis. Mat. Natur. Rend. Lincei Matem. Appl. Ser. 9, 1992, vol.\u00a03, no.\u00a04, pp.\u00a0233\u2013240.","journal-title":"Atti Accad. Naz. Lincei Cl. Sci. Fis. Mat. Natur. Rend. Lincei Matem. Appl. Ser. 9"},{"issue":"2","key":"5105_CR10","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1214\/aos\/1176344621","volume":"7","author":"J.R. Magnus","year":"1979","unstructured":"Magnus, J.R. and Neudecker, H., The Commutation Matrix: Some Properties and Applications, Ann. Statist., 1979, vol.\u00a07, no.\u00a02, pp.\u00a0381\u2013394. https:\/\/doi.org\/10.1214\/aos\/1176344621","journal-title":"Ann. Statist."},{"key":"5105_CR11","unstructured":"Semakov, N.V., Zinoviev, V.A., and Zaitsev, G.V., Correlation Decoding of Block Codes by Fast Fourier\u2013Hadamard Transforms, in Proc. 4th Symp. on Problem of Redundancy in Information Systems, Leningrad, 1970, Part 2, pp.\u00a0545\u2013550."},{"key":"5105_CR12","unstructured":"Zaitsev, G.V., Zinoviev, V.A., and Semakov, N.V., Fast Correlation Decoding of Block Codes, in Kodirovanie i peredacha diskretnykh soobshchenii v sistemakh svyazi (Coding and Transmission of Discrete Information in Communication Systems), Moscow: Nauka, 1976, pp.\u00a076\u201385."},{"issue":"7","key":"5105_CR13","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1080\/00207160.2010.509428","volume":"88","author":"J. Pieprzyk","year":"2011","unstructured":"Pieprzyk, J., Wang, H., and Zhang, X.-M., M\u00f6bius Transforms, Coincident Boolean Functions and Non-coincidence Property of Boolean Functions, Int. J. Comput. Math., 2011, vol.\u00a088, no.\u00a07, pp.\u00a01398\u20131416. https:\/\/doi.org\/10.1080\/00207160.2010.509428","journal-title":"Int. J. Comput. Math."},{"issue":"3","key":"5105_CR14","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0097-3165(76)90024-8","volume":"20","author":"O.S. Rothaus","year":"1976","unstructured":"Rothaus, O.S., On \u201cBent\u201d Functions, J. Combin. Theory, Ser. A, 1976, vol.\u00a020, no.\u00a03, pp.\u00a0300\u2013305. https:\/\/doi.org\/10.1016\/0097-3165(76)90024-8","journal-title":"J. Combin. Theory, Ser. A"},{"issue":"3\u20134","key":"5105_CR15","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W. Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., and Playoust, C., The Magma Algebra System, I: The User Language, J. Symbolic Comput., 1997, vol.\u00a024, no.\u00a03\u20134, pp.\u00a0235\u2013265. https:\/\/doi.org\/10.1006\/jsco.1996.0125","journal-title":"J. Symbolic Comput."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S003294602404001X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S003294602404001X","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S003294602404001X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:53:10Z","timestamp":1775011990000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S003294602404001X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["5105"],"URL":"https:\/\/doi.org\/10.1134\/s003294602404001x","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]},"assertion":[{"value":"10 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors of this work declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}