{"id":"https://openalex.org/W2920965311","doi":"https://doi.org/10.23919/isita.2018.8664263","title":"Complete Multipartite Graph Codes","display_name":"Complete Multipartite Graph Codes","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2920965311","doi":"https://doi.org/10.23919/isita.2018.8664263","mag":"2920965311"},"language":"en","primary_location":{"id":"doi:10.23919/isita.2018.8664263","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita.2018.8664263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064624099","display_name":"Yuta Kumano","orcid":null},"institutions":[{"id":"https://openalex.org/I1292669757","display_name":"Toshiba (Japan)","ror":"https://ror.org/0326v3z14","country_code":"JP","type":"company","lineage":["https://openalex.org/I1292669757"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yuta Kumano","raw_affiliation_strings":["System Technology Research & Development Center, Institute of Memory Technology Research & Development, Toshiba Memory Corporation"],"affiliations":[{"raw_affiliation_string":"System Technology Research & Development Center, Institute of Memory Technology Research & Development, Toshiba Memory Corporation","institution_ids":["https://openalex.org/I1292669757"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074951957","display_name":"Yoshiyuki Sakamaki","orcid":null},"institutions":[{"id":"https://openalex.org/I1292669757","display_name":"Toshiba (Japan)","ror":"https://ror.org/0326v3z14","country_code":"JP","type":"company","lineage":["https://openalex.org/I1292669757"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yoshiyuki Sakamaki","raw_affiliation_strings":["Corporate Research & Development Center, Toshiba Corporation"],"affiliations":[{"raw_affiliation_string":"Corporate Research & Development Center, Toshiba Corporation","institution_ids":["https://openalex.org/I1292669757"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085619623","display_name":"Hironori Uchikawa","orcid":"https://orcid.org/0000-0001-7517-445X"},"institutions":[{"id":"https://openalex.org/I1292669757","display_name":"Toshiba (Japan)","ror":"https://ror.org/0326v3z14","country_code":"JP","type":"company","lineage":["https://openalex.org/I1292669757"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hironori Uchikawa","raw_affiliation_strings":["System Technology Research & Development Center, Institute of Memory Technology Research & Development, Toshiba Memory Corporation"],"affiliations":[{"raw_affiliation_string":"System Technology Research & Development Center, Institute of Memory Technology Research & Development, Toshiba Memory Corporation","institution_ids":["https://openalex.org/I1292669757"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5064624099"],"corresponding_institution_ids":["https://openalex.org/I1292669757"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22595778,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"237","last_page":"241"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9854999780654907,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.6126183867454529},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4793601632118225},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4643208384513855},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45862382650375366},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.45005297660827637},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.42053964734077454},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.4117053151130676},{"id":"https://openalex.org/keywords/expander-code","display_name":"Expander code","score":0.41150668263435364},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4024432599544525},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.39857217669487},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.3847988247871399},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3573504686355591},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26969006657600403},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.19517114758491516},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.11069485545158386}],"concepts":[{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.6126183867454529},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4793601632118225},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4643208384513855},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45862382650375366},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.45005297660827637},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.42053964734077454},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.4117053151130676},{"id":"https://openalex.org/C108509264","wikidata":"https://www.wikidata.org/wiki/Q5420758","display_name":"Expander code","level":5,"score":0.41150668263435364},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4024432599544525},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.39857217669487},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.3847988247871399},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3573504686355591},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26969006657600403},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.19517114758491516},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.11069485545158386}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/isita.2018.8664263","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita.2018.8664263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.800000011920929,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1777069712","https://openalex.org/W1899301058","https://openalex.org/W1956910816","https://openalex.org/W2051888055","https://openalex.org/W2078486563","https://openalex.org/W2107787044","https://openalex.org/W2117432646","https://openalex.org/W2117971984","https://openalex.org/W2133068391","https://openalex.org/W2138236884","https://openalex.org/W2140655888","https://openalex.org/W2143781601","https://openalex.org/W2170758137","https://openalex.org/W2293231900","https://openalex.org/W2895239415","https://openalex.org/W3103606014"],"related_works":["https://openalex.org/W2959395619","https://openalex.org/W2295830426","https://openalex.org/W2098505542","https://openalex.org/W4386066307","https://openalex.org/W2016823805","https://openalex.org/W2029212810","https://openalex.org/W4372271439","https://openalex.org/W3141193846","https://openalex.org/W2606892216","https://openalex.org/W4237430502"],"abstract_inverted_index":{"Graph":[0],"codes":[1,17,26,43,57,81],"are":[2,18],"constructed":[3,44],"from":[4,45],"undirected":[5],"graphs":[6,48],"where":[7],"the":[8,13,21,79],"code":[9],"symbols":[10],"correspond":[11],"to":[12],"edges":[14],"and":[15,85],"component":[16],"associated":[19],"with":[20,66],"vertices.":[22],"We":[23],"investigate":[24],"graph":[25,42,56,80],"on":[27,36],"multigraphs":[28],"whereas":[29],"previous":[30],"work":[31],"has":[32],"mainly":[33],"studied":[34],"them":[35],"simple":[37],"graphs.":[38],"This":[39,70],"paper":[40,71],"proposes":[41],"complete":[46],"multipartite":[47],"as":[49],"generalizations":[50],"of":[51],"block-wise":[52,67],"product":[53,68],"codes.":[54,69,91],"The":[55],"show":[58],"better":[59],"error-correcting":[60],"performance":[61],"in":[62],"error-floor":[63],"region":[64],"compared":[65],"also":[72],"shows":[73],"an":[74],"efficient":[75],"encoding":[76,87],"method":[77],"for":[78,89],"by":[82],"employing":[83],"Richardson":[84],"Urbanke's":[86],"algorithm":[88],"LDPC":[90]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}