{"id":"https://openalex.org/W2850968244","doi":"https://doi.org/10.1007/s12095-019-00402-5","title":"On the minimum weights of binary linear complementary dual codes","display_name":"On the minimum weights of binary linear complementary dual codes","publication_year":2019,"publication_date":"2019-10-08","ids":{"openalex":"https://openalex.org/W2850968244","doi":"https://doi.org/10.1007/s12095-019-00402-5","mag":"2850968244"},"language":"en","primary_location":{"id":"doi:10.1007/s12095-019-00402-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12095-019-00402-5","pdf_url":null,"source":{"id":"https://openalex.org/S129219326","display_name":"Cryptography and Communications","issn_l":"1936-2447","issn":["1936-2447","1936-2455"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cryptography and Communications","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1807.03525","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019966275","display_name":"Makoto Araya","orcid":"https://orcid.org/0000-0002-9935-038X"},"institutions":[{"id":"https://openalex.org/I1298590031","display_name":"Shizuoka University","ror":"https://ror.org/01w6wtk13","country_code":"JP","type":"education","lineage":["https://openalex.org/I1298590031"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Makoto Araya","raw_affiliation_strings":["Department of Computer Science, Shizuoka University, Hamamatsu, 432\u20138011, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Shizuoka University, Hamamatsu, 432\u20138011, Japan","institution_ids":["https://openalex.org/I1298590031"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015902214","display_name":"Masaaki Harada","orcid":"https://orcid.org/0000-0002-2748-6456"},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Masaaki Harada","raw_affiliation_strings":["Research Center for Pure and Applied Mathematics, Graduate School of Information Sciences, Tohoku University, Sendai, 980\u20138579, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Center for Pure and Applied Mathematics, Graduate School of Information Sciences, Tohoku University, Sendai, 980\u20138579, Japan","institution_ids":["https://openalex.org/I201537933"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015902214"],"corresponding_institution_ids":["https://openalex.org/I201537933"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":1.7428,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.87680642,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"12","issue":"2","first_page":"285","last_page":"300"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10849","display_name":"Finite Group Theory Research","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dual-polyhedron","display_name":"Dual polyhedron","score":0.9018074870109558},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.7183545827865601},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6193494200706482},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6135843992233276},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5568935871124268},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5297632813453674},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4919404685497284},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.461626797914505},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.4397917687892914},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4179844856262207},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3931388258934021},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.19841796159744263},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19764339923858643},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1468639075756073},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.10470321774482727}],"concepts":[{"id":"https://openalex.org/C105313907","wikidata":"https://www.wikidata.org/wiki/Q1053857","display_name":"Dual polyhedron","level":2,"score":0.9018074870109558},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.7183545827865601},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6193494200706482},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6135843992233276},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5568935871124268},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5297632813453674},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4919404685497284},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.461626797914505},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.4397917687892914},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4179844856262207},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3931388258934021},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.19841796159744263},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19764339923858643},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1468639075756073},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.10470321774482727},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s12095-019-00402-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12095-019-00402-5","pdf_url":null,"source":{"id":"https://openalex.org/S129219326","display_name":"Cryptography and Communications","issn_l":"1936-2447","issn":["1936-2447","1936-2455"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cryptography and Communications","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1807.03525","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1807.03525","pdf_url":"https://arxiv.org/pdf/1807.03525","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1807.03525","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1807.03525","pdf_url":"https://arxiv.org/pdf/1807.03525","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G615565654","display_name":"A synthetic study of algebraic coding theory","funder_award_id":"19H01802","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1512024705","https://openalex.org/W1555388865","https://openalex.org/W1963946889","https://openalex.org/W1965097372","https://openalex.org/W1976677460","https://openalex.org/W1990600049","https://openalex.org/W1992796986","https://openalex.org/W2026316191","https://openalex.org/W2037342473","https://openalex.org/W2040531262","https://openalex.org/W2111913322","https://openalex.org/W2160893622","https://openalex.org/W2282104735","https://openalex.org/W2487737115","https://openalex.org/W2577690138","https://openalex.org/W2741525217","https://openalex.org/W2787275646","https://openalex.org/W2788668842","https://openalex.org/W2962894585","https://openalex.org/W2963376240","https://openalex.org/W2963425613","https://openalex.org/W3121556672"],"related_works":["https://openalex.org/W2793446615","https://openalex.org/W2020677672","https://openalex.org/W2523699569","https://openalex.org/W4324270384","https://openalex.org/W2030099148","https://openalex.org/W2032341808","https://openalex.org/W2058252876","https://openalex.org/W2091041828","https://openalex.org/W3143554305","https://openalex.org/W2086661663"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}