{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:02:41Z","timestamp":1773615761202,"version":"3.50.1"},"reference-count":14,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"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":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.3103\/s0146411623070040","type":"journal-article","created":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T14:02:19Z","timestamp":1709042539000},"page":"772-787","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Building Self-Complementary Codes and Their Application in Information Hiding"],"prefix":"10.3103","volume":"57","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1491-524X","authenticated-orcid":false,"given":"Y. V.","family":"Kosolapov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3225-9992","authenticated-orcid":false,"given":"F. S.","family":"Pevnev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9168-9875","authenticated-orcid":false,"given":"M. V.","family":"Yagubyants","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1627","published-online":{"date-parts":[[2024,2,27]]},"reference":[{"key":"7636_CR1","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/j.ffa.2017.12.010","volume":"50","author":"D. Jungnickel","year":"2018","unstructured":"Jungnickel, D. and Tonchev, V.D., The classification of antipodal two-weight linear codes, Finite Fields Their Appl., 2018, vol. 50, pp. 372\u2013381. https:\/\/doi.org\/10.1016\/j.ffa.2017.12.010","journal-title":"Finite Fields Their Appl."},{"key":"7636_CR2","doi-asserted-by":"publisher","unstructured":"Klove, T. and Yari, S., Proper self-complementary codes, 2010 Int. Symp. on Information Theory & Its Applications, Taichung, Taiwan, 2010, IEEE, 2010, pp. 118\u2013122. https:\/\/doi.org\/10.1109\/isita.2010.5649432","DOI":"10.1109\/isita.2010.5649432"},{"key":"7636_CR3","doi-asserted-by":"publisher","unstructured":"Gabidulin, E. and Bossert, M., Hard and soft decision decoding of phase rotation invariant block codes, 1998 Int. Zurich Seminar on Broadband Communications. Accessing, Transmission, Networking. Proc., Zurich, 1997, IEEE, 1997, pp. 65\u201384. https:\/\/doi.org\/10.1109\/izsbc.1998.670272","DOI":"10.1109\/izsbc.1998.670272"},{"key":"7636_CR4","doi-asserted-by":"publisher","first-page":"1506","DOI":"10.33048\/semi.2021.18.113","volume":"18","author":"Yu.V. Kosolapov","year":"2021","unstructured":"Kosolapov, Yu.V. and Pevnev, F.S., Error-tolerant ZZW-construction, Sibirskie Elektronnye Mat. Izv., 2021, vol. 18, no. 2, pp. 1506\u20131516. https:\/\/doi.org\/10.33048\/semi.2021.18.113","journal-title":"Sibirskie Elektronnye Mat. Izv."},{"key":"7636_CR5","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1109\/tit.1962.1057721","volume":"8","author":"L.D. Grey","year":"1962","unstructured":"Grey, L.D., Some bounds for error-correcting codes, IEEE Trans. Inf. Theory, 1962, vol. 8, no. 3, pp. 200\u2013202. https:\/\/doi.org\/10.1109\/tit.1962.1057721","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7636_CR6","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jcta.1997.2765","volume":"78","author":"G. McGuire","year":"1997","unstructured":"McGuire, G., Quasi-symmetric designs and codes meeting the Grey\u2013Rankin bound, J. Comb. Theory, Ser. A, 1997, vol. 78, no. 2, pp. 280\u2013291. https:\/\/doi.org\/10.1006\/jcta.1997.2765","journal-title":"J. Comb. Theory, Ser. A"},{"key":"7636_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1134\/s0032946007010020","volume":"43","author":"I. Bouyukliev","year":"2007","unstructured":"Bouyukliev, I., Bouyuklieva, S., and Dodunekov, S., On binary self-complementary [120, 9, 56] codes having an automorphism of order 3 and associated SDP designs, Probl. Inf. Transm., 2007, vol. 43, no. 2, pp. 89\u201396. https:\/\/doi.org\/10.1134\/s0032946007010020","journal-title":"Probl. Inf. Transm."},{"key":"7636_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/bf01388560","volume":"4","author":"S. Dodunekov","year":"1994","unstructured":"Dodunekov, S., Encheva, S., and Kapralov, S., On the [28, 7, 12] binary self-complementary codes and their residuals, Des.s, \n               Codes Cryptography, 1994, vol. 4, no. 1, pp. 57\u201367. https:\/\/doi.org\/10.1007\/bf01388560","journal-title":"Codes Cryptography"},{"key":"7636_CR9","unstructured":"Asemota, I., Binary self-complementary codes, BSc Thesis, Benin City, Nigeria: Benson Idahosa Univ., 2016."},{"key":"7636_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/0470035706","volume-title":"The Art of Error Correcting Coding","author":"R.H. Morelos-Zaragoza","year":"2006","unstructured":"Morelos-Zaragoza, R.H., The Art of Error Correcting Coding, Wiley, 2006, 2nd ed. https:\/\/doi.org\/10.1002\/0470035706"},{"key":"7636_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/bf00124893","volume":"2","author":"R. Hill","year":"1992","unstructured":"Hill, R. and Newton, D., Optimal ternary linear codes, Des., \n               Codes Cryptography, 1992, vol. 2, no. 2, pp.\u00a0137\u2013157. https:\/\/doi.org\/10.1007\/bf00124893","journal-title":"Codes Cryptography"},{"key":"7636_CR12","doi-asserted-by":"publisher","unstructured":"Tomlinson, M., Tjhai, C.J., Ambroze, M., Ahmed, M., and Jibril, M., Error-Correction Coding and Decoding: Bounds, Codes, Decoders, Analysis and Applications, Signals and Communication Technology, Cham: Springer, 2017. https:\/\/doi.org\/10.1007\/978-3-319-51103-0","DOI":"10.1007\/978-3-319-51103-0"},{"key":"7636_CR13","unstructured":"Deundyak, V.M., Maevskij, A.E., and Mogilevskaya, N.S., Metody pomekhoustoichivoi zashchity dannykh (Methods for Noise-Stable Data Protection), Rostov-on-Don: Yuzhn. Fed. Univ., 2014."},{"key":"7636_CR14","unstructured":"Ja, D.B., Binary Linear Codes: New Results on Nonexistence, 1996. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.44.628&rep=rep1&type=pdf."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411623070040.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411623070040","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411623070040.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:04:13Z","timestamp":1773612253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411623070040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12]]},"references-count":14,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["7636"],"URL":"https:\/\/doi.org\/10.3103\/s0146411623070040","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12]]},"assertion":[{"value":"27 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2024","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"}}]}}