{"id":"https://openalex.org/W1659060437","doi":"https://doi.org/10.1109/isit.2015.7282457","title":"Converse and duality results for combinatorial source-channel coding in binary Hamming spaces","display_name":"Converse and duality results for combinatorial source-channel coding in binary Hamming spaces","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1659060437","doi":"https://doi.org/10.1109/isit.2015.7282457","mag":"1659060437"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282457","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/101007","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027363610","display_name":"Andrew J. Young","orcid":"https://orcid.org/0000-0002-7868-6896"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andrew J. Young","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, USA","Department of Electrical Engineering and Computer Science , MIT , Cambridge, MA, 02139, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science , MIT , Cambridge, MA, 02139, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031031216","display_name":"Yury Polyanskiy","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yury Polyanskiy","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, USA","Department of Electrical Engineering and Computer Science , MIT , Cambridge, MA, 02139, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science , MIT , Cambridge, MA, 02139, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5027363610"],"corresponding_institution_ids":["https://openalex.org/I4210110987"],"apc_list":null,"apc_paid":null,"fwci":2.669,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.91453897,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"261","last_page":"265"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9995999932289124,"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.9995999932289124,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9991999864578247,"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/T10125","display_name":"Advanced Wireless Communication Techniques","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.8191004991531372},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6147705316543579},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5508043766021729},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5419950485229492},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.49063459038734436},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.45931342244148254},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4413205087184906},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.4392138421535492},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.43826085329055786},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.4318183958530426},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.42328551411628723},{"id":"https://openalex.org/keywords/hamming-graph","display_name":"Hamming graph","score":0.4203200340270996},{"id":"https://openalex.org/keywords/converse-theorem","display_name":"Converse theorem","score":0.41739484667778015},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.41548052430152893},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4142433702945709},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3716856837272644},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3626667261123657},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3489443063735962},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33517828583717346},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.2933746576309204},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.22210508584976196},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.21339380741119385},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.17552053928375244},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.129032164812088},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.11553114652633667}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.8191004991531372},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6147705316543579},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5508043766021729},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5419950485229492},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.49063459038734436},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.45931342244148254},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4413205087184906},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.4392138421535492},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.43826085329055786},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.4318183958530426},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.42328551411628723},{"id":"https://openalex.org/C29696283","wikidata":"https://www.wikidata.org/wiki/Q369440","display_name":"Hamming graph","level":5,"score":0.4203200340270996},{"id":"https://openalex.org/C204591131","wikidata":"https://www.wikidata.org/wiki/Q5166461","display_name":"Converse theorem","level":3,"score":0.41739484667778015},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.41548052430152893},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4142433702945709},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3716856837272644},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3626667261123657},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3489443063735962},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33517828583717346},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.2933746576309204},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.22210508584976196},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.21339380741119385},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.17552053928375244},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.129032164812088},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.11553114652633667},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C132817261","wikidata":"https://www.wikidata.org/wiki/Q1134435","display_name":"Automorphic form","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2015.7282457","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/101007","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/101007","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/101007","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/101007","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1510599311","https://openalex.org/W1606480398","https://openalex.org/W1737688151","https://openalex.org/W2052181759","https://openalex.org/W2067500519","https://openalex.org/W2109084006","https://openalex.org/W2136780942","https://openalex.org/W2275285919","https://openalex.org/W4285719527","https://openalex.org/W6637828082","https://openalex.org/W6667416745"],"related_works":["https://openalex.org/W1964096323","https://openalex.org/W2508005517","https://openalex.org/W3205622575","https://openalex.org/W1797153894","https://openalex.org/W1905328716","https://openalex.org/W2101101242","https://openalex.org/W2125977161","https://openalex.org/W1548865325","https://openalex.org/W2090068344","https://openalex.org/W1659060437"],"abstract_inverted_index":{"This":[0],"article":[1],"continues":[2],"the":[3,12,28,60,64],"recent":[4],"investigation":[5],"of":[6,15,41,63,87],"combinatorial":[7],"joint":[8],"source-channel":[9],"coding.":[10],"For":[11],"special":[13],"case":[14],"a":[16],"binary":[17],"source":[18,34],"and":[19,53,91,97],"channel":[20,42],"subject":[21],"to":[22,93],"distortion":[23,35],"measured":[24],"by":[25],"Hamming":[26],"distance,":[27],"lower":[29],"(converse)":[30],"bounds":[31],"on":[32,79],"achievable":[33],"are":[36,89],"improved":[37],"for":[38,84],"all":[39],"values":[40,86],"noise.":[43],"Operational":[44],"duality":[45],"between":[46,81],"coding":[47],"with":[48],"bandwidth":[49],"expansion":[50],"factors":[51],"\u03c1":[52,56,73,88],"1":[54],"over":[55],"is":[57,69],"established.":[58],"Although":[59],"exact":[61],"value":[62],"asymptotic":[65],"noise-distortion":[66],"tradeoff":[67],"curve":[68],"unknown":[70],"(except":[71],"at":[72],"=":[74],"1),":[75],"some":[76],"initial":[77],"results":[78],"inter-relations":[80],"these":[82],"curves":[83],"different":[85],"shown":[90],"lead":[92],"statements":[94],"about":[95],"monotonicity":[96],"continuity":[98],"in":[99],"\u03c1.":[100]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}