{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:38:11Z","timestamp":1765546691033,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,10,29]],"date-time":"2020-10-29T00:00:00Z","timestamp":1603929600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,29]],"date-time":"2020-10-29T00:00:00Z","timestamp":1603929600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003336","name":"Bulgarian National Science Fund","doi-asserted-by":"publisher","award":["DN 02\/2\/13.12.2016"],"award-info":[{"award-number":["DN 02\/2\/13.12.2016"]}],"id":[{"id":"10.13039\/501100003336","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003336","name":"Bulgarian National Science Fund","doi-asserted-by":"publisher","award":["KP-06-N32\/2-2019"],"award-info":[{"award-number":["KP-06-N32\/2-2019"]}],"id":[{"id":"10.13039\/501100003336","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003336","name":"Bulgarian National Science Fund","doi-asserted-by":"publisher","award":["KP-06-N32\/2-2019"],"award-info":[{"award-number":["KP-06-N32\/2-2019"]}],"id":[{"id":"10.13039\/501100003336","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s12095-020-00458-8","type":"journal-article","created":{"date-parts":[[2020,10,29]],"date-time":"2020-10-29T20:02:40Z","timestamp":1604001760000},"page":"263-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Characteristic vector and weight distribution of a linear code"],"prefix":"10.1007","volume":"13","author":[{"given":"Iliya","family":"Bouyukliev","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9557-4749","authenticated-orcid":false,"given":"Stefka","family":"Bouyuklieva","sequence":"additional","affiliation":[]},{"given":"Tatsuya","family":"Maruta","sequence":"additional","affiliation":[]},{"given":"Paskal","family":"Piperkov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,29]]},"reference":[{"key":"458_CR1","unstructured":"Baart, R., Boothby, T., Cramwinckel, J., Fields, J., Joyner, D., Miller, R., Minkes, E., Roijackers, E., Ruscio, L., Tjhai, C.: GAP package GUAVA. https:\/\/www.gap-system.org\/Packages\/guava.html"},{"key":"458_CR2","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1504\/IJICOT.2018.091816","volume":"5","author":"E Bellini","year":"2018","unstructured":"Bellini, E., Sala, M.: A deterministic algorithm for the distance and weight distribution of binary nonlinear codes. Int. J. Inform. Coding Theory (IJICOT) 5, 18\u201335 (2018)","journal-title":"Int. J. Inform. Coding Theory (IJICOT)"},{"key":"458_CR3","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"ER Berlekamp","year":"1978","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.: On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory 24, 384\u2013386 (1978)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"458_CR4","first-page":"21","volume":"18","author":"D Bikov","year":"2018","unstructured":"Bikov, D., Bouyukliev, I.: Parallel fast walsh transform algorithm and its implementation with CUDA on GPUs. Cybern. Inform. Technol. 18, 21\u201343 (2018)","journal-title":"Cybern. Inform. Technol."},{"key":"458_CR5","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00200-008-0080-2","volume":"19","author":"M Borges-Quintana","year":"2008","unstructured":"Borges-Quintana, M., Borges-Trenard, M.A., Fitzpatrick, P., Mart\u00ednez-Moro, E.: Groebner bases and combinatorics for binary codes. Appl. Algebra Eng. Comm. Comput. 19, 393\u2013411 (2008)","journal-title":"Appl. Algebra Eng. Comm. Comput."},{"issue":"8","key":"458_CR6","doi-asserted-by":"publisher","first-page":"1550128","DOI":"10.1142\/S0219498815501285","volume":"14","author":"M Borges-Quintana","year":"2015","unstructured":"Borges-Quintana, M., Borges-Trenard, M.A., M\u00e1rquez-Corbella, I., Mart\u00ednez-Moro, E.: Computing coset leaders and leader codewords of binary codes. J. Algebra Appl. 14(8), 1550128 (2015)","journal-title":"J. Algebra Appl."},{"key":"458_CR7","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., Playoust, C.: The Magma algebra system i: The user language. J. Symbolic Comput. 24, 235\u2013265 (1997). https:\/\/doi.org\/10.1006\/jsco.1996.0125","journal-title":"J. Symbolic Comput."},{"key":"458_CR8","first-page":"115","volume":"1","author":"I Bouyukliev","year":"2007","unstructured":"Bouyukliev, I.: What is Q-Extension? Serdica. J. Comput. 1, 115\u2013130 (2007)","journal-title":"J. Comput."},{"key":"458_CR9","doi-asserted-by":"publisher","first-page":"2986","DOI":"10.1016\/j.dam.2008.01.003","volume":"156","author":"I Bouyukliev","year":"2008","unstructured":"Bouyukliev, I., Bakoev, V.: A method for efficiently computing the number of codewords of fixed weights in linear codes. Discret. Appl. Math. 156, 2986\u20133004 (2008)","journal-title":"Discret. Appl. Math."},{"key":"458_CR10","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Boolean functions for cryptography and error correcting codes. In: Crama, Y., Hammer, P.L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, in: Encyclopedia Math. Appl., vol. 134. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511780448.011"},{"issue":"2","key":"458_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1008344232130","volume":"15","author":"C Carlet","year":"1998","unstructured":"Carlet, C., Charpin, P., Zinoviev, V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Crypt. 15(2), 125\u2013156 (1998)","journal-title":"Des. Codes Crypt."},{"issue":"1","key":"458_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.37236\/1375","volume":"5","author":"S Dodunekov","year":"1998","unstructured":"Dodunekov, S., Simonis, J.: Codes and projective multisets. Electron. J. Comb. 5(1), 37 (1998)","journal-title":"Electron. J. Comb."},{"issue":"6","key":"458_CR13","doi-asserted-by":"publisher","first-page":"2023","DOI":"10.1109\/18.641570","volume":"43","author":"R Dodunekova","year":"1997","unstructured":"Dodunekova, R., Dodunekov, S.M.: Sufficient conditions for good and proper error-detecting codes. IEEE Trans. Inform. Theory 43(6), 2023\u20132026 (1997)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"458_CR14","unstructured":"Edel, Y., Pott, A.: On the equivalence of nonlinear functions. In: Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes, NATO Science for Peace and Security Series - D: Information and Communication Security, vol. 23, pp 87\u2013103. IOS Press (2009)"},{"key":"458_CR15","volume-title":"Fast Transforms: Algorithms, Analises, Applications","author":"DF Elliott","year":"1982","unstructured":"Elliott, D.F., Rao, K.R.: Fast Transforms: Algorithms, Analises, Applications. Academic Press, Orlando (1982)"},{"issue":"8","key":"458_CR16","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1016\/j.jalgebra.2008.09.037","volume":"321","author":"M Giorgetti","year":"2009","unstructured":"Giorgetti, M., Sala, M.: A commutative algebra approach to linear codes. J. Algebra 321(8), 2259\u20132286 (2009)","journal-title":"J. Algebra"},{"issue":"2","key":"458_CR17","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1111\/j.2517-6161.1958.tb00300.x","volume":"20","author":"IJ Good","year":"1958","unstructured":"Good, I.J.: The interaction algorithm and practical fourier analysis. J. Royal Stat. Soc. 20(2), 361\u2013372 (1958)","journal-title":"J. Royal Stat. Soc."},{"key":"458_CR18","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0096-3003(98)10050-4","volume":"103","author":"T Gulliver","year":"1999","unstructured":"Gulliver, T., Bhargava, V., Stein, J.: Q-ary Gray codes and weight distributions. Appl. Math Comput. 103, 97\u2013109 (1999)","journal-title":"Appl. Math Comput."},{"key":"458_CR19","doi-asserted-by":"publisher","first-page":"609","DOI":"10.12988\/ces.2016.6448","volume":"9","author":"S Han","year":"2016","unstructured":"Han, S., Seo, H.S., Ju, S.: Efficient calculation of the weight distributions for linear codes over large finite fields. Contemporary Engineering Sciences 9, 609\u2013617 (2016)","journal-title":"Contemporary Engineering Sciences"},{"key":"458_CR20","doi-asserted-by":"crossref","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of error-correcting codes. Cambridge Univ. Press (2003)","DOI":"10.1017\/CBO9780511807077"},{"key":"458_CR21","doi-asserted-by":"crossref","unstructured":"Jan, B., Montrucchio, B., Ragusa, C., Khan, F.G., Khan, O.: Parallel butterfly sorting algorithm on GPU. In: Proceedings of Artificial Intelligence and Applications, pp 795\u2013026, Innsbruck, Austria (2013)","DOI":"10.2316\/P.2013.795-026"},{"key":"458_CR22","doi-asserted-by":"publisher","DOI":"10.1201\/9781420070033","volume-title":"Algorithmic Cryptanalysis","author":"A Joux","year":"2009","unstructured":"Joux, A.: Algorithmic Cryptanalysis. Chapman & Hall\/CRC, Boca Raton (2009)"},{"key":"458_CR23","doi-asserted-by":"crossref","unstructured":"Jurrius, R., Pellikaan, R.: Codes, arrangements and matroids. In: Algebraic geometry modeling in information theory, in: Series on Coding Theory and Cryptology, vol. 8. World Scientific Publishing (2013)","DOI":"10.1142\/9789814335768_0006"},{"issue":"1","key":"458_CR24","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1109\/TIT.1979.1056001","volume":"25","author":"MG Karpovsky","year":"1979","unstructured":"Karpovsky, M.G.: On the weight distribution of binary linear codes. IEEE Trans. Inform. Theory 25(1), 105\u2013109 (1979)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"458_CR25","first-page":"19","volume":"23","author":"GL Katsman","year":"1987","unstructured":"Katsman, G.L., Tsfasman, M.A.: Spectra of algebraic-geometric codes. Probl. Peredachi Inf. 23(4), 19\u201334 (1987)","journal-title":"Probl. Peredachi Inf."},{"issue":"6","key":"458_CR26","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1109\/TIT.1972.1054898","volume":"18","author":"F MacWilliams","year":"1972","unstructured":"MacWilliams, F., Mallows, C., Sloane, N.: Generalizations of Gleason\u2019s theorem on weight enumerators of self-dual codes. IEEE Trans. Inform. Theory 18 (6), 794\u2013805 (1972)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"458_CR27","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. Elsevier, North-Holland (1977)"},{"issue":"2","key":"458_CR28","doi-asserted-by":"publisher","first-page":"229","DOI":"10.3934\/amc.2016003","volume":"10","author":"I M\u00e1rquez-Corbella","year":"2016","unstructured":"M\u00e1rquez-Corbella, I., Mart\u00ednez-Moro, E., Su\u00e1rez-Canedo, E.: On the ideal associated to a linear code. Advances in Mathematics of Communications 10(2), 229\u2013254 (2016)","journal-title":"Advances in Mathematics of Communications"},{"key":"458_CR29","volume-title":"Introduction to Parallel Processing: Algorithms and Architectures, Series in Computer Science","author":"B Parhami","year":"2002","unstructured":"Parhami, B.: Introduction to Parallel Processing: Algorithms and Architectures, Series in Computer Science. Springer, Berlin (2002)"},{"key":"458_CR30","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1142\/S0219498807002260","volume":"6","author":"M Sala","year":"2007","unstructured":"Sala, M.: Gr\u00f6bner basis techniques to compute weight distributions of shortened cyclic codes. J. Algebra Appl. 6, 403\u2013414 (2007)","journal-title":"J. Algebra Appl."},{"key":"458_CR31","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/18.850662","volume":"46","author":"N Sendrier","year":"2000","unstructured":"Sendrier, N.: Finding the permutation between equivalent linear codes: The support splitting algorithm. IEEE Trans. Inform. Theory 46, 1193\u20131203 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"458_CR32","doi-asserted-by":"crossref","unstructured":"Stichtenoth, H.: Subfield subcodes and trace codes. In: Algebraic function fields and codes. graduate texts in mathematics, vol. 254. Springer, Berlin (2009)","DOI":"10.1007\/978-3-540-76878-4"},{"issue":"6","key":"458_CR33","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.641542","volume":"43","author":"A Vardy","year":"1997","unstructured":"Vardy, A.: The intractability of computing the minimum distance of a code. IEEE Trans. Inform. Theory 43(6), 1757\u20131766 (1997)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-020-00458-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-020-00458-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-020-00458-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T17:04:48Z","timestamp":1723827888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-020-00458-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,29]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["458"],"URL":"https:\/\/doi.org\/10.1007\/s12095-020-00458-8","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2020,10,29]]},"assertion":[{"value":"15 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}