{"id":"https://openalex.org/W2133251283","doi":"https://doi.org/10.1109/isit.2009.5205858","title":"Some fundamental coding theoretic limits of unequal error protection","display_name":"Some fundamental coding theoretic limits of unequal error protection","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2133251283","doi":"https://doi.org/10.1109/isit.2009.5205858","mag":"2133251283"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205858","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205858","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","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/A5108379152","display_name":"Shashi Borade","orcid":null},"institutions":[{"id":"https://openalex.org/I4210107408","display_name":"New York Proton Center","ror":"https://ror.org/01m7v2988","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210107408"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Shashi Borade","raw_affiliation_strings":["New York, NY, USA","New York, 10019, USA"],"affiliations":[{"raw_affiliation_string":"New York, NY, USA","institution_ids":["https://openalex.org/I4210107408"]},{"raw_affiliation_string":"New York, 10019, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110619770","display_name":"Sujay Sanghavi","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sujay Sanghavi","raw_affiliation_strings":["Purdue University, West Lafayette, IN, USA","Purdue University. West Lafayette, IN 47907, USA"],"affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Purdue University. West Lafayette, IN 47907, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108379152"],"corresponding_institution_ids":["https://openalex.org/I4210107408"],"apc_list":null,"apc_paid":null,"fwci":2.535,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.90337137,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"15","issue":null,"first_page":"2231","last_page":"2235"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9983999729156494,"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.9983999729156494,"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.996399998664856,"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/T11130","display_name":"Coding theory and cryptography","score":0.9962999820709229,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6219914555549622},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6178898215293884},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5913789868354797},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.5910434126853943},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5538331270217896},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.5075746774673462},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45714452862739563},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45139333605766296},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.45077112317085266},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.44888558983802795},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43495601415634155},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.411538302898407},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3523330092430115},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3407782018184662},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.21268662810325623},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08630052208900452}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6219914555549622},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6178898215293884},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5913789868354797},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.5910434126853943},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5538331270217896},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.5075746774673462},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45714452862739563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45139333605766296},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.45077112317085266},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.44888558983802795},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43495601415634155},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.411538302898407},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3523330092430115},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3407782018184662},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.21268662810325623},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08630052208900452},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2009.5205858","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205858","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1549664537","https://openalex.org/W1973286131","https://openalex.org/W2152596625","https://openalex.org/W2293583839","https://openalex.org/W2895239415"],"related_works":["https://openalex.org/W2008960744","https://openalex.org/W2105471374","https://openalex.org/W2740543340","https://openalex.org/W1987803429","https://openalex.org/W2158117886","https://openalex.org/W1582340598","https://openalex.org/W1519122282","https://openalex.org/W2743336384","https://openalex.org/W2182731056","https://openalex.org/W2157753730"],"abstract_inverted_index":{"This":[0],"paper":[1],"investigates":[2],"asymptotic":[3],"(in":[4],"blocklength)":[5],"tradeoffs":[6],"between":[7],"rate":[8],"and":[9,34,38,56,73],"minimum":[10],"distance,":[11],"for":[12,52,61,97],"codes":[13],"that":[14,69,119],"provide":[15],"unequal":[16],"error":[17,176],"protection":[18,150],"(UEP).":[19],"Two":[20],"notions":[21,49],"of":[22,30,43,89,151,162,168,175],"UEP":[23,60],"are":[24,50,124,165],"analyzed:":[25],"bit-wise,":[26],"where":[27,40],"a":[28,41,130],"subset":[29,42],"bits":[31,123],"is":[32,46,93,108,117,146],"special":[33,71,111,132,154],"needs":[35],"more":[36],"protection,":[37],"message-wise,":[39],"the":[44,62,70,79,90,104,121,126,140,149,152,169],"message-set":[45],"special.":[47],"Both":[48],"analyzed":[51],"two":[53],"cases:":[54],"binary,":[55],"large-alphabet.":[57],"In":[58,113],"message-wise":[59],"binary":[63,141],"channel":[64],"alphabet,":[65],"it":[66,116],"turns":[67],"out":[68],"messages":[72,75],"ordinary":[74,122],"can":[76],"simultaneously":[77],"achieve":[78,135],"Gilbert-Varshamov":[80],"bound":[81,92,145],"at":[82],"their":[83],"respective":[84],"rates.":[85],"Similar":[86],"\u00bfsuccessive":[87],"refinement\u00bf":[88],"Singleton":[91,127],"shown":[94,118],"to":[95],"hold":[96],"large":[98],"non-binary":[99],"alphabets.":[100],"We":[101],"also":[102],"analyze":[103],"situation":[105],"when":[106,120],"there":[107],"only":[109],"one":[110],"message.":[112],"bit-wise":[114],"UEP,":[115],"achieving":[125],"bound,":[128],"even":[129],"single":[131,153],"bit":[133],"cannot":[134],"any":[136],"larger":[137],"distance.":[138],"For":[139],"case,":[142],"an":[143],"upper":[144],"provided":[147],"on":[148],"bit.":[155],"These":[156],"coding":[157],"theoretic":[158,171],"limits":[159,172],"in":[160,173],"terms":[161,174],"Hamming":[163],"distances":[164],"close":[166],"analogues":[167],"information":[170],"exponents.":[177]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}