{"id":"https://openalex.org/W3185170010","doi":"https://doi.org/10.1109/isit45174.2021.9518013","title":"Linear Programming Bounds for Almost-Balanced Binary Codes","display_name":"Linear Programming Bounds for Almost-Balanced Binary Codes","publication_year":2021,"publication_date":"2021-07-12","ids":{"openalex":"https://openalex.org/W3185170010","doi":"https://doi.org/10.1109/isit45174.2021.9518013","mag":"3185170010"},"language":"en","primary_location":{"id":"doi:10.1109/isit45174.2021.9518013","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9518013","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2107.07672","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":["Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,15213"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066919379","display_name":"Andrii Riazanov","orcid":"https://orcid.org/0000-0002-5173-7614"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrii Riazanov","raw_affiliation_strings":["Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,15213","Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,15213","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068388812"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09913929,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1302","last_page":"1307"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9995999932289124,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.778221845626831},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6957845687866211},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6742926836013794},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6181595325469971},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.585468053817749},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5222885608673096},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4737485349178314},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.47212013602256775},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4703778624534607},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.451871395111084},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1750423014163971},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1162106990814209},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.111657053232193},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.07158443331718445}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.778221845626831},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6957845687866211},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6742926836013794},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6181595325469971},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.585468053817749},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5222885608673096},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4737485349178314},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.47212013602256775},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4703778624534607},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.451871395111084},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1750423014163971},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1162106990814209},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.111657053232193},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.07158443331718445},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/isit45174.2021.9518013","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9518013","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2107.07672","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2107.07672","pdf_url":"https://arxiv.org/pdf/2107.07672","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:3185170010","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2107.07672v1","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2107.07672","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2107.07672","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2107.07672","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2107.07672","pdf_url":"https://arxiv.org/pdf/2107.07672","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1740449593","display_name":null,"funder_award_id":"CCF-1563742","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3280610492","display_name":"CIF: Small: New Coding Techniques for Synchronization Errors","funder_award_id":"1814603","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4202698560","display_name":null,"funder_award_id":"1563742","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G521757348","display_name":null,"funder_award_id":"CF-1814603","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6751408502","display_name":null,"funder_award_id":"CCF-1814603","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8098284054","display_name":null,"funder_award_id":"CCF-1563742,CCF-1814603","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3185170010.pdf","grobid_xml":"https://content.openalex.org/works/W3185170010.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W109405981","https://openalex.org/W1967009268","https://openalex.org/W1981075218","https://openalex.org/W2019807548","https://openalex.org/W2100990159","https://openalex.org/W2105635932","https://openalex.org/W2109084006","https://openalex.org/W2115422885","https://openalex.org/W2138524567","https://openalex.org/W2625993870"],"related_works":["https://openalex.org/W3198389005","https://openalex.org/W2116555776","https://openalex.org/W2137806147","https://openalex.org/W1498820893","https://openalex.org/W1757800676","https://openalex.org/W1998657826","https://openalex.org/W2056125990","https://openalex.org/W3103875663","https://openalex.org/W2114067035","https://openalex.org/W1979807171","https://openalex.org/W2493619896","https://openalex.org/W62628603","https://openalex.org/W2963978969","https://openalex.org/W2280334468","https://openalex.org/W2169207476","https://openalex.org/W2556398241","https://openalex.org/W150897135","https://openalex.org/W2963109481","https://openalex.org/W2165626072","https://openalex.org/W3029297920"],"abstract_inverted_index":{"We":[0,53,89],"revisit":[1],"the":[2,7,17,20,42,50,62,75,79,83,96,109,112,124],"linear":[3],"programming":[4],"bounds":[5,18],"for":[6,12,19,61,86,123],"size":[8],"vs.":[9],"distance":[10,44,67],"trade-off":[11],"binary":[13],"codes,":[14],"focusing":[15],"on":[16],"almost-balanced":[21,63,125],"case,":[22],"when":[23],"all":[24],"pairwise":[25],"distances":[26],"are":[27],"between":[28],"<tex":[29,33,38,46,68],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[30,34,39,47,69],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$d$</tex>":[31,40],"and":[32,45,117],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n-d$</tex>":[35],",":[36,71],"where":[37],"is":[41,49,106],"code":[43],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>":[48],"block":[51],"length.":[52],"give":[54],"an":[55],"optimal":[56,76],"solution":[57],"to":[58,121],"Delsarte's":[59],"LP":[60,80,98],"case":[64],"with":[65,82],"large":[66],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$d\\geq(n-\\sqrt{n})/2+1$</tex>":[70],"which":[72],"shows":[73],"that":[74,92,104],"value":[77],"of":[78,95,111],"coincides":[81],"Grey-Rankin":[84],"bound":[85,99,116],"self-complementary":[87],"codes.":[88],"also":[90],"show":[91],"a":[93],"limitation":[94],"asymptotic":[97],"shown":[100],"by":[101],"Samorodnitsky,":[102],"namely":[103],"it":[105],"at":[107],"least":[108],"average":[110],"first":[113],"MRRW":[114],"upper":[115],"Gilbert-Varshamov":[118],"bound,":[119],"continues":[120],"hold":[122],"case.":[126]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}