{"id":"https://openalex.org/W2766354467","doi":"https://doi.org/10.1109/ncc.2017.8077036","title":"A linear programming based channel coding strong converse for the BSC and BEC","display_name":"A linear programming based channel coding strong converse for the BSC and BEC","publication_year":2017,"publication_date":"2017-03-01","ids":{"openalex":"https://openalex.org/W2766354467","doi":"https://doi.org/10.1109/ncc.2017.8077036","mag":"2766354467"},"language":"en","primary_location":{"id":"doi:10.1109/ncc.2017.8077036","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc.2017.8077036","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":"conference-paper","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/A5025595195","display_name":"Sharu Theresa Jose","orcid":"https://orcid.org/0000-0001-8872-3462"},"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":"Sharu Theresa Jose","raw_affiliation_strings":["Systems and Control Engineering, Indian Institute of Technology Bombay, Mumbai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Systems and Control Engineering, Indian Institute of Technology Bombay, Mumbai, India","institution_ids":["https://openalex.org/I162827531"]}]},{"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, Mumbai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Systems and Control Engineering, Indian Institute of Technology Bombay, Mumbai, India","institution_ids":["https://openalex.org/I162827531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I162827531"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"1","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.9997000098228455,"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.9997000098228455,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9994000196456909,"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.9961000084877014,"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/converse","display_name":"Converse","score":0.9644516706466675},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.7867809534072876},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.6704681515693665},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6656270623207092},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.6478462815284729},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.6331037282943726},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5992783308029175},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5585529804229736},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5531609058380127},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.5159466862678528},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.5133732557296753},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.448998361825943},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.438754677772522},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4192875325679779},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3183019757270813},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.30913716554641724},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.19307902455329895},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13512927293777466},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07825642824172974},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07708841562271118}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.9644516706466675},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.7867809534072876},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.6704681515693665},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6656270623207092},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.6478462815284729},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.6331037282943726},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5992783308029175},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5585529804229736},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5531609058380127},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.5159466862678528},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.5133732557296753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.448998361825943},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.438754677772522},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4192875325679779},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3183019757270813},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.30913716554641724},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.19307902455329895},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13512927293777466},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07825642824172974},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07708841562271118},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ncc.2017.8077036","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc.2017.8077036","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"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/03d434bd-75e4-4570-826a-0262c0392029","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/03d434bd-75e4-4570-826a-0262c0392029","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jose, S & Kulkarni, A A 2017, A linear programming based channel coding strong converse for the BSC and BEC. in 2017 Twenty-third National Conference on Communications (NCC). National Conference on Communications (NCC), IEEE, Twenty-third National Conference on Communications (NCC), Chennai, India, 2/03/17. https://doi.org/10.1109/NCC.2017.8077036","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.atira.dk:publications/03d434bd-75e4-4570-826a-0262c0392029","is_oa":false,"landing_page_url":"https://birmingham.elsevierpure.com/en/publications/03d434bd-75e4-4570-826a-0262c0392029","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jose , S & Kulkarni , A A 2017 , A linear programming based channel coding strong converse for the BSC and BEC . in 2017 Twenty-third National Conference on Communications (NCC) . National Conference on Communications (NCC) , IEEE , Twenty-third National Conference on Communications (NCC) , Chennai , India , 2/03/17 . https://doi.org/10.1109/NCC.2017.8077036","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1588709600","https://openalex.org/W2000446566","https://openalex.org/W2090369384","https://openalex.org/W2094027184","https://openalex.org/W2196937749","https://openalex.org/W2289423878","https://openalex.org/W2962972025","https://openalex.org/W6725192704"],"related_works":["https://openalex.org/W2139769859","https://openalex.org/W2140357074","https://openalex.org/W2502955786","https://openalex.org/W2113562070","https://openalex.org/W2162141500","https://openalex.org/W2810502498","https://openalex.org/W2583282232","https://openalex.org/W2028268383","https://openalex.org/W2372190485","https://openalex.org/W3103136794"],"abstract_inverted_index":{"This":[0],"paper":[1],"illustrates":[2],"the":[3,6,14,81,85,99],"application":[4],"of":[5,27,43],"linear":[7],"programming":[8],"(LP)":[9],"based":[10],"framework":[11],"proposed":[12],"by":[13],"authors":[15],"previously":[16],"[1]":[17],"in":[18],"deriving":[19],"improved":[20],"converses":[21,49,60,82],"for":[22,50,88,97],"finite":[23,45],"blocklength":[24,46],"channel":[25,33,38,47],"coding":[26,48],"a":[28,94],"discrete":[29],"memoryless":[30],"binary":[31,36],"symmetric":[32],"(BSC)":[34],"and":[35,52,90],"erasure":[37],"(BEC).":[39],"Employing":[40],"elementary":[41],"concepts":[42],"optimization,":[44],"BSC":[51,89],"BEC":[53],"are":[54],"derived":[55,62],"from":[56],"first":[57],"principles.":[58],"The":[59],"thus":[61],"do":[63],"not":[64],"rely":[65],"on":[66],"information":[67,72,74],"theoretic":[68],"constructs":[69],"like":[70],"tilted":[71],"or":[73],"densities.":[75],"Moreover,":[76],"it":[77],"is":[78],"shown":[79],"that":[80],"obtained":[83],"imply":[84],"strong":[86,100],"converse":[87,101],"BEC,":[91],"thereby":[92],"introducing":[93],"new":[95],"approach":[96],"explaining":[98],"phenomenon.":[102]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}