{"id":"https://openalex.org/W4415366840","doi":"https://doi.org/10.1109/isit63088.2025.11195455","title":"Bounds on Box Codes","display_name":"Bounds on Box Codes","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415366840","doi":"https://doi.org/10.1109/isit63088.2025.11195455"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195455","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195455","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 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/A5011741113","display_name":"Michael Langberg","orcid":"https://orcid.org/0000-0002-7470-0718"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Langberg","raw_affiliation_strings":["University at Buffalo,Department of Electrical Engineering,Buffalo,NY,USA,14260"],"affiliations":[{"raw_affiliation_string":"University at Buffalo,Department of Electrical Engineering,Buffalo,NY,USA,14260","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054043026","display_name":"Moshe Schwartz","orcid":"https://orcid.org/0000-0002-1449-0026"},"institutions":[{"id":"https://openalex.org/I98251732","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29","country_code":"CA","type":"education","lineage":["https://openalex.org/I98251732"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Moshe Schwartz","raw_affiliation_strings":["McMaster University,Department of Electrical and Computer Engineering,Hamilton,ON,Canada,L8S 4K1"],"affiliations":[{"raw_affiliation_string":"McMaster University,Department of Electrical and Computer Engineering,Hamilton,ON,Canada,L8S 4K1","institution_ids":["https://openalex.org/I98251732"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085150941","display_name":"Itzhak Tamo","orcid":"https://orcid.org/0000-0002-8000-0419"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Itzhak Tamo","raw_affiliation_strings":["Tel Aviv University,Department of Electrical Engineering-Systems,Tel Aviv,Israel,6997801"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University,Department of Electrical Engineering-Systems,Tel Aviv,Israel,6997801","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5011741113"],"corresponding_institution_ids":["https://openalex.org/I63190737"],"apc_list":null,"apc_paid":null,"fwci":1.6666,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.89094582,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9304999709129333,"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.9304999709129333,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9261000156402588,"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/bipartite-graph","display_name":"Bipartite graph","score":0.6359000205993652},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.6236000061035156},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5375999808311462},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4629000127315521},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.4514999985694885},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.42149999737739563},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.39800000190734863},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3928999900817871}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.678600013256073},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6359000205993652},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6274999976158142},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.6236000061035156},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5375999808311462},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5141000151634216},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4629000127315521},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.4514999985694885},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.42149999737739563},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.39800000190734863},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3928999900817871},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.3431999981403351},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.3377000093460083},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3179999887943268},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2770000100135803},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2685000002384186},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.26829999685287476},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.25999999046325684},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.2558000087738037}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195455","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195455","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1584248758","https://openalex.org/W1606480398","https://openalex.org/W1969461599","https://openalex.org/W1992472342","https://openalex.org/W2116220645","https://openalex.org/W4406260760","https://openalex.org/W4415366840"],"related_works":[],"abstract_inverted_index":{"Let":[0],"<tex":[1,11,17,23,27,48,53,107],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[2,12,18,24,28,49,54,108],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n_{q}(M,":[3,29,55],"d)$</tex>":[4,30,51,56,111],"be":[5],"the":[6,38,96],"minimum":[7,21],"length":[8,74],"of":[9,15,40,52,73,98],"a":[10,32,46],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$q$</tex>-ary":[13],"code":[14],"size":[16],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$M$</tex>":[19],"and":[20,65,72,103],"distance":[22,71],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$d$</tex>.":[25],"Bounding":[26],"is":[31],"fundamental":[33],"problem":[34],"that":[35],"lies":[36],"at":[37],"heart":[39],"coding":[41],"theory.":[42],"This":[43],"work":[44],"considers":[45],"generalization":[47],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n_{q}^{\\bullet}(M,":[50],"corresponding":[57],"to":[58,79,87],"codes":[59],"in":[60,95],"which":[61],"codewords":[62],"have":[63,91],"protected":[64,80],"unprotected":[66],"entries;":[67],"where":[68],"(analogs":[69],"of)":[70],"are":[75,112],"measured":[76],"with":[77],"respect":[78],"entries":[81],"only.":[82],"Such":[83],"codes,":[84,90],"here":[85],"referred":[86],"as":[88],"box":[89],"seen":[92],"prior":[93],"studies":[94],"context":[97],"bipartite":[99],"graph":[100],"covering.":[101],"Upper":[102],"lower":[104],"bounds":[105],"on":[106],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n_{q}^{\\bullet":[109],"\\bullet}(M,":[110],"presented.":[113]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}