{"id":"https://openalex.org/W1535530436","doi":"https://doi.org/10.1007/11402763_10","title":"Algorithms for the Maximum Hamming Distance Problem","display_name":"Algorithms for the Maximum Hamming Distance Problem","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1535530436","doi":"https://doi.org/10.1007/11402763_10","mag":"1535530436"},"language":"en","primary_location":{"id":"doi:10.1007/11402763_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11402763_10","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/A5000958088","display_name":"Ola Angelsmark","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Ola Angelsmark","raw_affiliation_strings":["Department of Computer and Information Science, Link\u00f6pings Universitet, S-581 83, Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6pings Universitet, S-581 83, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082914834","display_name":"Johan Thapper","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Johan Thapper","raw_affiliation_strings":["Department of Mathematics, Link\u00f6pings Universitet, S-581 83, Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Link\u00f6pings Universitet, S-581 83, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000958088"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.3931,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.81302801,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"128","last_page":"141"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9965000152587891,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/hamming-distance","display_name":"Hamming distance","score":0.8612533211708069},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6518528461456299},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6384985446929932},{"id":"https://openalex.org/keywords/hamming-graph","display_name":"Hamming graph","score":0.5253947377204895},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.5239990949630737},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.483859658241272},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46961456537246704},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4463125467300415},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4405028820037842},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.11079522967338562}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.8612533211708069},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6518528461456299},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6384985446929932},{"id":"https://openalex.org/C29696283","wikidata":"https://www.wikidata.org/wiki/Q369440","display_name":"Hamming graph","level":5,"score":0.5253947377204895},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5239990949630737},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.483859658241272},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46961456537246704},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4463125467300415},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4405028820037842},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.11079522967338562},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11402763_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11402763_10","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1504850494","https://openalex.org/W1508924483","https://openalex.org/W1982174487","https://openalex.org/W2009384947","https://openalex.org/W2011039300","https://openalex.org/W2027506801","https://openalex.org/W2031823362","https://openalex.org/W2066749637","https://openalex.org/W2126442135","https://openalex.org/W2139364539"],"related_works":["https://openalex.org/W2105471374","https://openalex.org/W2740543340","https://openalex.org/W2008960744","https://openalex.org/W2067417168","https://openalex.org/W4283763810","https://openalex.org/W1519122282","https://openalex.org/W2098310607","https://openalex.org/W153182557","https://openalex.org/W1582340598","https://openalex.org/W2779867339"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}