{"id":"https://openalex.org/W2766558705","doi":"https://doi.org/10.1109/ncc.2017.8077142","title":"Non-constructive lower bounds for binary asymmetric error correcting codes","display_name":"Non-constructive lower bounds for binary asymmetric error correcting codes","publication_year":2017,"publication_date":"2017-03-01","ids":{"openalex":"https://openalex.org/W2766558705","doi":"https://doi.org/10.1109/ncc.2017.8077142","mag":"2766558705"},"language":"en","primary_location":{"id":"doi:10.1109/ncc.2017.8077142","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc.2017.8077142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Twenty-third National Conference on Communications (NCC)","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/A5083224560","display_name":"Parthe Pandit","orcid":"https://orcid.org/0000-0002-2524-8817"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Parthe Pandit","raw_affiliation_strings":["Electrical Engineering, University of California, Los Angeles"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering, University of California, Los Angeles","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069273068","display_name":"Ankur A. Kulkarni","orcid":"https://orcid.org/0000-0001-8139-5216"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ankur A. Kulkarni","raw_affiliation_strings":["Systems and Control Engineering, Indian Institute of Technology Bombay"],"affiliations":[{"raw_affiliation_string":"Systems and Control Engineering, Indian Institute of Technology Bombay","institution_ids":["https://openalex.org/I162827531"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083224560"],"corresponding_institution_ids":["https://openalex.org/I161318765"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18126171,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9977999925613403,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9977999925613403,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.994700014591217,"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/T12534","display_name":"Protein Degradation and Inhibitors","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.6860308051109314},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6110163927078247},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5916504263877869},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.5383706092834473},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.523926317691803},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4730479121208191},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4688839614391327},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4606684446334839},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4569251537322998},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4169348180294037},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4069015681743622},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3749907612800598},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3455919027328491},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.32178816199302673},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.20517846941947937}],"concepts":[{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.6860308051109314},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6110163927078247},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5916504263877869},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.5383706092834473},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.523926317691803},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4730479121208191},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4688839614391327},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4606684446334839},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4569251537322998},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4169348180294037},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4069015681743622},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3749907612800598},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3455919027328491},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.32178816199302673},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20517846941947937},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"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":1,"locations":[{"id":"doi:10.1109/ncc.2017.8077142","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc.2017.8077142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Twenty-third National Conference on Communications (NCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2068871408","https://openalex.org/W2127236769","https://openalex.org/W2301532929","https://openalex.org/W2798909945","https://openalex.org/W2963183421","https://openalex.org/W6697828812"],"related_works":["https://openalex.org/W4213150077","https://openalex.org/W2369410163","https://openalex.org/W2059018062","https://openalex.org/W2604585036","https://openalex.org/W2078477160","https://openalex.org/W1989103179","https://openalex.org/W1991172810","https://openalex.org/W125803343","https://openalex.org/W2117632582","https://openalex.org/W4388347373"],"abstract_inverted_index":{"Lower":[0],"bounds":[1,25,73,89],"on":[2,74],"maximum":[3],"error":[4,92],"correcting":[5,81,93],"codes":[6,94],"have":[7],"commonly":[8],"been":[9],"obtained":[10,99],"via":[11],"code":[12,80],"construction.":[13],"In":[14],"this":[15,27,67],"paper":[16],"we":[17,69],"introduce":[18],"a":[19,39,53,102],"non-constructive":[20,71],"approach":[21,86],"for":[22,26,90],"finding":[23],"lower":[24,72,88],"problem.":[28],"Recently,":[29],"Pandit":[30],"and":[31],"Kulkarni":[32],"[6]":[33],"formulated":[34],"the":[35,49,60,64,75,78,111,118],"independence":[36],"number":[37],"of":[38,52,63,77,105,107],"graph":[40],"as":[41,95,121],"an":[42],"l":[43],"<sub":[44],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[45],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sub>":[46],"maximization":[47],"over":[48],"solution":[50],"set":[51],"linear":[54,103],"complementarity":[55],"problem":[56],"(LCP)":[57],"associated":[58],"with":[59],"adjacency":[61],"matrix":[62],"graph.":[65],"Using":[66],"formulation,":[68],"derive":[70],"size":[76,108],"largest":[79],"binary":[82],"asymmetric":[83],"errors.":[84],"Our":[85,113],"facilitates":[87],"multiple":[91],"well":[96],"which":[97],"are":[98],"by":[100],"solving":[101],"system":[104],"equations":[106],"less":[109],"than":[110,117],"block-length.":[112],"bound":[114],"is":[115,122],"tighter":[116],"Caro-Wei":[119],"bound,":[120],"demonstrated":[123],"empirically.":[124]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}