{"id":"https://openalex.org/W69972012","doi":"https://doi.org/10.1007/978-3-642-20901-7_12","title":"The Minimum Distance of Graph Codes","display_name":"The Minimum Distance of Graph Codes","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W69972012","doi":"https://doi.org/10.1007/978-3-642-20901-7_12","mag":"69972012"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-20901-7_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-20901-7_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5061203057","display_name":"Tom H\u00f8holdt","orcid":null},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Tom H\u00f8holdt","raw_affiliation_strings":["Department of Mathematics, The Technical University of Denmark, Bldg. 303, DK 2800, Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, The Technical University of Denmark, Bldg. 303, DK 2800, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105887807","display_name":"J\u00f8rn Justesen","orcid":null},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"J\u00f8rn Justesen","raw_affiliation_strings":["Department of Mathematics, The Technical University of Denmark, Bldg. 303, DK 2800, Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, The Technical University of Denmark, Bldg. 303, DK 2800, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061203057"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.0069,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.8576673,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"201","last_page":"212"},"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.9991999864578247,"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/T11130","display_name":"Coding theory and cryptography","score":0.9970999956130981,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7010457515716553},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6175615191459656},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6166344285011292},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5629265308380127},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.47516104578971863},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.46479886770248413},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.46020007133483887},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45851919054985046},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4321995973587036},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.41446158289909363},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.41007089614868164},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40455111861228943},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2916402518749237},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2879287302494049},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2757090628147125},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.1723044216632843},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07360997796058655},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06069287657737732}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7010457515716553},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6175615191459656},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6166344285011292},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5629265308380127},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.47516104578971863},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.46479886770248413},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.46020007133483887},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45851919054985046},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4321995973587036},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.41446158289909363},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.41007089614868164},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40455111861228943},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2916402518749237},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2879287302494049},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2757090628147125},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.1723044216632843},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07360997796058655},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06069287657737732},{"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-20901-7_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-20901-7_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:publications/42cfa0c3-e07b-4b91-98b0-0f05be829119","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/42cfa0c3-e07b-4b91-98b0-0f05be829119","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"H\u00f8holdt , T & Justesen , J 2011 , ' The Minimum Distance of Graph Codes ' , Lecture Notes in Computer Science , vol. 6639 , pp. 201-212 . https://doi.org/10.1007/978-3-642-20901-7_12","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W618390265","https://openalex.org/W1530740238","https://openalex.org/W1589291987","https://openalex.org/W1970912697","https://openalex.org/W2040452405","https://openalex.org/W2107787044","https://openalex.org/W2121284046","https://openalex.org/W2130094178","https://openalex.org/W2133068391","https://openalex.org/W2137271753","https://openalex.org/W2138236884","https://openalex.org/W2149231487","https://openalex.org/W2293231900","https://openalex.org/W2895239415","https://openalex.org/W2986001730","https://openalex.org/W3102535214","https://openalex.org/W4234341801","https://openalex.org/W4244464855","https://openalex.org/W4255297036"],"related_works":["https://openalex.org/W135568846","https://openalex.org/W2460434904","https://openalex.org/W1789159349","https://openalex.org/W2113911300","https://openalex.org/W2151857680","https://openalex.org/W4386066307","https://openalex.org/W832867880","https://openalex.org/W917159298","https://openalex.org/W1975697476","https://openalex.org/W2086661663"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}