{"id":"https://openalex.org/W2787653234","doi":"https://doi.org/10.1109/itw.2017.8277964","title":"Linear programming based finite blocklength converses for some network-like problems","display_name":"Linear programming based finite blocklength converses for some network-like problems","publication_year":2017,"publication_date":"2017-11-01","ids":{"openalex":"https://openalex.org/W2787653234","doi":"https://doi.org/10.1109/itw.2017.8277964","mag":"2787653234"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2017.8277964","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2017.8277964","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Information Theory Workshop (ITW)","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/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":true,"raw_author_name":"Sharu Theresa Jose","raw_affiliation_strings":["Systems and Control Engineering, Indian Institute of Technology Bombay, Mumbai, India"],"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"],"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":2,"corresponding_author_ids":["https://openalex.org/A5025595195"],"corresponding_institution_ids":["https://openalex.org/I162827531"],"apc_list":null,"apc_paid":null,"fwci":0.5841,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71703623,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"1","issue":null,"first_page":"544","last_page":"548"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998999834060669,"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.9994999766349792,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9990000128746033,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.9778599739074707},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.6660834550857544},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.6272714138031006},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5730401277542114},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.562904953956604},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5172763466835022},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.504489541053772},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4462175667285919},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4357488751411438},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4163150191307068},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38647669553756714},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3583337664604187},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3236255645751953},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32297980785369873},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10792836546897888},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09772884845733643}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.9778599739074707},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.6660834550857544},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.6272714138031006},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5730401277542114},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.562904953956604},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5172763466835022},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.504489541053772},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4462175667285919},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4357488751411438},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4163150191307068},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38647669553756714},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3583337664604187},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3236255645751953},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32297980785369873},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10792836546897888},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09772884845733643},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/itw.2017.8277964","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2017.8277964","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/334111a9-d1c3-49f5-a5a8-d02b44c09234","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/334111a9-d1c3-49f5-a5a8-d02b44c09234","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 , Linear Programming based Finite Blocklength Converses for Some Network-like Problems . in IEEE Information Theory Workshop (ITW) .","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1484170624","https://openalex.org/W1588709600","https://openalex.org/W2025455049","https://openalex.org/W2094027184","https://openalex.org/W2106864314","https://openalex.org/W2196937749","https://openalex.org/W2625472422","https://openalex.org/W2962915224","https://openalex.org/W2962972025","https://openalex.org/W3105659800","https://openalex.org/W4251984466"],"related_works":["https://openalex.org/W2158824308","https://openalex.org/W2159058996","https://openalex.org/W2963226898","https://openalex.org/W2787653234","https://openalex.org/W4301735652","https://openalex.org/W1491239575","https://openalex.org/W4299563878","https://openalex.org/W2952815608","https://openalex.org/W2089848464","https://openalex.org/W2073479625"],"abstract_inverted_index":{"The":[0,66],"linear":[1],"programming":[2],"(LP)":[3],"based":[4],"approach":[5,45,68],"we":[6],"introduced":[7],"in":[8,90],"[1]":[9],"for":[10,15,55,62,82],"finding":[11],"finite":[12,79],"blocklength":[13,26,80],"converses":[14,47],"joint":[16],"source-channel":[17],"coding":[18,28,84],"is":[19,40,69,95],"extended":[20,71],"to":[21,72],"some":[22],"network-like":[23],"settings.":[24],"Finite":[25],"channel":[27],"of":[29],"compound":[30,64],"and":[31,58,76],"averaged":[32],"channels":[33,57],"under":[34],"the":[35,43,63,73,88],"maximum":[36],"probability":[37],"error":[38],"criterion":[39],"considered.":[41],"Through":[42],"LP":[44,67],"new":[46,78],"are":[48],"obtained":[49],"which":[50,85],"imply":[51],"a":[52,59,77],"weak":[53],"converse":[54,61,81,89],"both":[56],"strong":[60],"channel.":[65],"also":[70],"networked":[74],"setting":[75],"Slepian-Wolf":[83],"improves":[86],"on":[87],"Han":[91],"[2,":[92],"Lemma":[93],"7.2.2]":[94],"derived.":[96]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}