{"id":"https://openalex.org/W4289655321","doi":"https://doi.org/10.1109/isit50566.2022.9834443","title":"Lower bounds for Multiple Packing","display_name":"Lower bounds for Multiple Packing","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655321","doi":"https://doi.org/10.1109/isit50566.2022.9834443"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834443","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834443","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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/A5100350077","display_name":"Yihan Zhang","orcid":"https://orcid.org/0000-0002-6465-6258"},"institutions":[{"id":"https://openalex.org/I132118926","display_name":"Austrian Institute of Technology","ror":"https://ror.org/04knbh022","country_code":"AT","type":"facility","lineage":["https://openalex.org/I132118926"]},{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Yihan Zhang","raw_affiliation_strings":["Institute of Science and Technology,Austria","Institute of Science and Technology, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Science and Technology,Austria","institution_ids":["https://openalex.org/I132118926"]},{"raw_affiliation_string":"Institute of Science and Technology, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028319993","display_name":"Shashank Vatedka","orcid":"https://orcid.org/0000-0003-2384-9392"},"institutions":[{"id":"https://openalex.org/I65181880","display_name":"Indian Institute of Technology Hyderabad","ror":"https://ror.org/01j4v3x97","country_code":"IN","type":"education","lineage":["https://openalex.org/I65181880"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Shashank Vatedka","raw_affiliation_strings":["Indian Institute of Technology,Department of Electrical Engineering,Hyderabad","Department of Electrical Engineering, Indian Institute of Technology, Hyderabad"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology,Department of Electrical Engineering,Hyderabad","institution_ids":["https://openalex.org/I65181880"]},{"raw_affiliation_string":"Department of Electrical Engineering, Indian Institute of Technology, Hyderabad","institution_ids":["https://openalex.org/I65181880"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100350077"],"corresponding_institution_ids":["https://openalex.org/I132118926","https://openalex.org/I157556583"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17708333,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3085","last_page":"3090"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12404","display_name":"Mathematical Approximation and Integration","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12404","display_name":"Mathematical Approximation and Integration","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9961000084877014,"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/combinatorics","display_name":"Combinatorics","score":0.8015069961547852},{"id":"https://openalex.org/keywords/sphere-packing","display_name":"Sphere packing","score":0.687659502029419},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.5982666015625},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5650395154953003},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5568166375160217},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5500067472457886},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.5294883847236633},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5255557298660278},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.45053738355636597},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4486267864704132},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.44639572501182556},{"id":"https://openalex.org/keywords/discrete-geometry","display_name":"Discrete geometry","score":0.4177805781364441},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3510407507419586},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.21886596083641052},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1489633321762085},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11386659741401672}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8015069961547852},{"id":"https://openalex.org/C183893376","wikidata":"https://www.wikidata.org/wiki/Q900117","display_name":"Sphere packing","level":2,"score":0.687659502029419},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.5982666015625},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5650395154953003},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5568166375160217},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5500067472457886},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.5294883847236633},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5255557298660278},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.45053738355636597},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4486267864704132},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.44639572501182556},{"id":"https://openalex.org/C4107886","wikidata":"https://www.wikidata.org/wiki/Q906377","display_name":"Discrete geometry","level":2,"score":0.4177805781364441},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3510407507419586},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.21886596083641052},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1489633321762085},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11386659741401672},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit50566.2022.9834443","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834443","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:raiith.iith.ac.in:10386","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400292","display_name":"Research Archive of Indian Institute of Technology Hyderabad (Indian Institute of Technology Hyderabad)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I65181880","host_organization_name":"Indian Institute of Technology Hyderabad","host_organization_lineage":["https://openalex.org/I65181880"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"},{"id":"pmh:oai:pub.research-explorer.ista.ac.at:12015","is_oa":false,"landing_page_url":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9834443","pdf_url":null,"source":{"id":"https://openalex.org/S7407055285","display_name":"Institute of Science and Technology Austria","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Zhang Y, Vatedka S. Lower bounds for multiple packing. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. IEEE; 2022:3085-3090. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834443\">10.1109/ISIT50566.2022.9834443</a>","raw_type":"http://purl.org/coar/resource_type/c_5794"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W109405981","https://openalex.org/W144396020","https://openalex.org/W1568318909","https://openalex.org/W1993944611","https://openalex.org/W2039760073","https://openalex.org/W2045503106","https://openalex.org/W2098320263","https://openalex.org/W2106215079","https://openalex.org/W2122459744","https://openalex.org/W2124291447","https://openalex.org/W2163615738","https://openalex.org/W2170716519","https://openalex.org/W2328042459","https://openalex.org/W2964334889","https://openalex.org/W2977073685","https://openalex.org/W3080751879","https://openalex.org/W3178780836","https://openalex.org/W4292414116","https://openalex.org/W6604469142","https://openalex.org/W6605775354","https://openalex.org/W6797846821"],"related_works":["https://openalex.org/W1993644547","https://openalex.org/W2057875651","https://openalex.org/W2083379047","https://openalex.org/W2301261742","https://openalex.org/W1977424097","https://openalex.org/W4302805402","https://openalex.org/W2568571446","https://openalex.org/W2949964158","https://openalex.org/W4251859436","https://openalex.org/W2082359756"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,61,91,116,149,158],"problem":[3],"of":[4,17,43,63,70,95,118,162],"high-dimensional":[5,137],"multiple":[6,37,97,109,128,163],"packing":[7,12,19,38,164],"in":[8,45,54,60,77],"Euclidean":[9],"space.":[10],"Multiple":[11],"is":[13,21,39],"a":[14,40,96,104,166],"natural":[15],"generalization":[16],"sphere":[18],"and":[20,30,122,139],"defined":[22],"as":[23],"follows.":[24],"Let":[25],"P,":[26],"N":[27],">":[28],"0":[29],"$L":[31],"\\in":[32],"{{\\mathbb{Z}}_{":[33],"\\geq":[34],"2}}$.":[35],"A":[36],"set":[41],"${\\mathcal{C}}$":[42],"points":[44,76],"${{\\mathcal{B}}^n}(\\underline{0}":[46],",\\sqrt":[47],"{nP}":[48],")$":[49],"such":[50],"that":[51,180],"any":[52],"point":[53],"\u211d":[55],"<sup":[56,79],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[57,80],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sup>":[58],"lies":[59],"intersection":[62],"at":[64],"most":[65],"L":[66],"\u2013":[67],"1":[68],"balls":[69],"radius":[71],"$\\sqrt":[72],"{nN}":[73],"$":[74],"around":[75],"${\\mathcal{C}}$.":[78],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sup>":[81],"In":[82],"this":[83,131],"paper,":[84],"we":[85,112,133],"derive":[86],"two":[87],"lower":[88],"bounds":[89,100],"on":[90],"largest":[92],"possible":[93],"density":[94],"packing.":[98,110,129],"These":[99],"are":[101,182],"obtained":[102,156],"through":[103,165],"stronger":[105],"notion":[106,161],"called":[107],"average-radius":[108,127],"Specifically,":[111],"exactly":[113],"pin":[114],"down":[115],"asymptotics":[117],"(expurgated)":[119,123],"Gaussian":[120,177],"codes":[121,125,147,178],"spherical":[124,146,186],"under":[126],"To":[130],"end,":[132],"apply":[134],"tools":[135],"from":[136],"geometry":[138],"large":[140],"deviation":[141],"theory.":[142],"The":[143,174],"bound":[144,153,175],"for":[145,157,176],"matches":[148],"previous":[150],"best":[151],"known":[152],"which":[154],"was":[155],"standard":[159],"(weaker)":[160],"curious":[167],"connection":[168],"with":[169],"error":[170],"exponents":[171],"[Bli99],":[172],"[ZV21].":[173],"suggests":[179],"they":[181],"strictly":[183],"inferior":[184],"to":[185],"codes.":[187]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}