{"id":"https://openalex.org/W4387355999","doi":"https://doi.org/10.48550/arxiv.2310.01883","title":"Reduction and efficient solution of MILP models of mixed Hamming packings yielding improved upper bounds","display_name":"Reduction and efficient solution of MILP models of mixed Hamming packings yielding improved upper bounds","publication_year":2023,"publication_date":"2023-10-03","ids":{"openalex":"https://openalex.org/W4387355999","doi":"https://doi.org/10.48550/arxiv.2310.01883"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2310.01883","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2310.01883","pdf_url":"https://arxiv.org/pdf/2310.01883","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2310.01883","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049160844","display_name":"P\u00e9ter Naszvadi","orcid":"https://orcid.org/0009-0000-6330-2397"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Naszvadi, P\u00e9ter","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5053809970","display_name":"M\u00e1ty\u00e1s Koniorczyk","orcid":"https://orcid.org/0000-0002-2710-493X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Koniorczyk, M\u00e1ty\u00e1s","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049160844"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.988099992275238,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.988099992275238,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9814000129699707,"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/T11159","display_name":"Manufacturing Process and Optimization","score":0.946399986743927,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7083749175071716},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6907267570495605},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6751214861869812},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6104806661605835},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5678247213363647},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5333929657936096},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5009653568267822},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.46961623430252075},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4408491253852844},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37332257628440857},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.334117591381073},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32215040922164917},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30536243319511414},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.1991625428199768},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.051386624574661255}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.7083749175071716},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6907267570495605},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6751214861869812},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6104806661605835},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5678247213363647},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5333929657936096},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5009653568267822},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.46961623430252075},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4408491253852844},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37332257628440857},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.334117591381073},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32215040922164917},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30536243319511414},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.1991625428199768},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.051386624574661255},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2310.01883","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2310.01883","pdf_url":"https://arxiv.org/pdf/2310.01883","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.2310.01883","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2310.01883","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2310.01883","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2310.01883","pdf_url":"https://arxiv.org/pdf/2310.01883","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3488833788","display_name":null,"funder_award_id":"K12435","funder_id":"https://openalex.org/F4320336675","funder_display_name":"National Research, Development and Innovation Office"},{"id":"https://openalex.org/G7220148119","display_name":null,"funder_award_id":"K133882","funder_id":"https://openalex.org/F4320336675","funder_display_name":"National Research, Development and Innovation Office"},{"id":"https://openalex.org/G7472709510","display_name":null,"funder_award_id":"K124351","funder_id":"https://openalex.org/F4320336675","funder_display_name":"National Research, Development and Innovation Office"}],"funders":[{"id":"https://openalex.org/F4320325904","display_name":"P\u00e9csi Tudom\u00e1nyegyetem","ror":"https://ror.org/037b5pv06"},{"id":"https://openalex.org/F4320336675","display_name":"National Research, Development and Innovation Office","ror":null}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4387355999.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2371167013","https://openalex.org/W1964096323","https://openalex.org/W4300879987","https://openalex.org/W4302771537","https://openalex.org/W2740543340","https://openalex.org/W2119135810","https://openalex.org/W2951416090","https://openalex.org/W2105471374","https://openalex.org/W2008960744","https://openalex.org/W2014631828"],"abstract_inverted_index":{"Mixed":[0],"Hamming":[1,12],"packings":[2],"are":[3,54,60],"considered:":[4],"the":[5,25,40],"maximal":[6],"cardinality":[7],"given":[8],"a":[9,36],"minimum":[10],"codeword":[11],"distance":[13],"of":[14,27,58],"mixed":[15,20],"codes":[16],"is":[17,42],"addressed":[18],"via":[19],"integer":[21],"programming":[22],"models.":[23],"Adopting":[24],"concept":[26],"contact":[28],"graph":[29],"from":[30],"classical":[31],"continuous":[32],"sphere":[33],"packing":[34],"problems,":[35],"reduction":[37],"technique":[38],"for":[39],"models":[41],"introduced,":[43],"which":[44],"enables":[45],"their":[46],"efficient":[47],"solution.":[48],"Several":[49],"best":[50],"known":[51],"upper":[52],"bounds":[53],"improved":[55],"and":[56],"some":[57],"them":[59],"found":[61],"to":[62],"be":[63],"sharp.":[64]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2023-10-05T00:00:00"}