{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T23:05:08Z","timestamp":1783897508400,"version":"3.55.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032222206","type":"print"},{"value":"9783032222213","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22221-3_45","type":"book-chapter","created":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T22:33:52Z","timestamp":1783895632000},"page":"405-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["About Parallelization of\u00a0Algorithm for\u00a0Computation of\u00a0Covering Radius of\u00a0Linear Codes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3489-7744","authenticated-orcid":false,"given":"Maria","family":"Pashinska-Gadzheva","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6730-1129","authenticated-orcid":false,"given":"Iliya","family":"Bouyukliev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,3]]},"reference":[{"key":"45_CR1","unstructured":"Baicheva, T., Bouyukliev, I.: On the ternary projective codes with dimensions 4 and 5. In: Proc of the International Workshop on Algebraic and Combinatorial Coding Theory, Kranevo, Bulgaria, pp. 34\u201339 (2004)"},{"issue":"1","key":"45_CR2","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1109\/18.904549","volume":"47","author":"TS Baicheva","year":"2001","unstructured":"Baicheva, T.S.: On the covering radius of ternary negacyclic codes with length up to 26. IEEE Trans. Inf. Theory 47(1), 413\u2013416 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"45_CR3","doi-asserted-by":"publisher","first-page":"399","DOI":"10.3934\/amc.2010.4.399","volume":"4","author":"TS Baicheva","year":"2010","unstructured":"Baicheva, T.S., Bouyukliev, I.: On the least covering radius of binary linear codes of dimension 6. Adv. Math. Commun. 4(3), 399\u2013404 (2010)","journal-title":"Adv. Math. Commun."},{"issue":"2","key":"45_CR4","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1109\/TIT.2014.2385084","volume":"61","author":"D Bartoli","year":"2014","unstructured":"Bartoli, D., Giulietti, M., Platoni, I.: On the covering radius of mds codes. IEEE Trans. Inf. Theory 61(2), 801\u2013811 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"15","key":"45_CR5","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(15), 2986\u20133004 (2008)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"45_CR6","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/S0895480104441085","volume":"19","author":"I Bouyukliev","year":"2005","unstructured":"Bouyukliev, I., \u00d6stergard, P.R.: Classification of self-orthogonal codes over $${\\mathbb{F}}_{3}$$ and $${\\mathbb{F}}_{4}$$. SIAM J. Discret. Math. 19(2), 363\u2013370 (2005)","journal-title":"SIAM J. Discret. Math."},{"issue":"7","key":"45_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.3390\/a17070311","volume":"17","author":"S Bouyuklieva","year":"2024","unstructured":"Bouyuklieva, S., Bouyukliev, I., Bakoev, V., Pashinska-Gadzheva, M.: Generating m-ary gray codes and related algorithms. Algorithms 17(7), 311 (2024)","journal-title":"Algorithms"},{"key":"45_CR8","unstructured":"Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering codes. Elsevier (1997)"},{"issue":"6","key":"45_CR9","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1007\/s12095-023-00652-4","volume":"15","author":"V Gillot","year":"2023","unstructured":"Gillot, V., Langevin, P.: Classification of some cosets of the Reed-Muller code. Cryptogr. Commun. 15(6), 1129\u20131137 (2023)","journal-title":"Cryptogr. Commun."},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Micciancio, D., Regev, O.: The complexity of the covering radius problem. Comput. Complexity 14(2), 90\u2013121 (2005)","DOI":"10.1007\/s00037-005-0193-y"},{"issue":"2","key":"45_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0166-218X(85)80006-8","volume":"11","author":"T Helleseth","year":"1985","unstructured":"Helleseth, T.: On the covering radius of cyclic linear codes and arithmetic codes. Discret. Appl. Math. 11(2), 157\u2013173 (1985)","journal-title":"Discret. Appl. Math."},{"key":"45_CR12","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of error-correcting codes. Cambridge university press (2010)"},{"issue":"7","key":"45_CR13","doi-asserted-by":"publisher","first-page":"2359","DOI":"10.1109\/18.887850","volume":"46","author":"M Ozeki","year":"2000","unstructured":"Ozeki, M.: On covering radii and coset weight distributions of extremal binary self-dual codes of length 56. IEEE Trans. Inf. Theory 46(7), 2359\u20132372 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"45_CR14","unstructured":"Van der Pas, R., Stotzer, E., Terboven, C.: Using OpenMP# the next step: affinity, accelerators, tasking, and simd. MIT press (2017)"},{"key":"45_CR15","doi-asserted-by":"crossref","unstructured":"Pashinska-Gadzheva, M., Bouyukliev, I.: About methods of vector addition over finite fields using extended vector registers. In: International Conference on Large-Scale Scientific Computing, pp. 427\u2013434. Springer (2023)","DOI":"10.1007\/978-3-031-56208-2_44"}],"container-title":["Lecture Notes in Computer Science","Large-Scale Scientific Computations"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22221-3_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T22:33:53Z","timestamp":1783895633000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22221-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032222206","9783032222213"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22221-3_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"3 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LSSC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Large-Scale Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sozopol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bulgaria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lssc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/parallel.bas.bg\/Conferences\/SciCom25\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}