{"id":"https://openalex.org/W2006285925","doi":"https://doi.org/10.1109/isit.2014.6875288","title":"Achievability bounds for unequal message protection at finite block lengths","display_name":"Achievability bounds for unequal message protection at finite block lengths","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2006285925","doi":"https://doi.org/10.1109/isit.2014.6875288","mag":"2006285925"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6875288","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875288","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 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/A5052329970","display_name":"Yanina Y. Shkel","orcid":"https://orcid.org/0000-0002-2575-1762"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yanina Y. Shkel","raw_affiliation_strings":["Electrical and Computer Engineering, University of Wisconsin-Madison","Electr. & Comput. Eng., Univ. of Wisconsin-Madison, Madison, WI, USA"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, University of Wisconsin-Madison","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"Electr. & Comput. Eng., Univ. of Wisconsin-Madison, Madison, WI, USA","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058345431","display_name":"Vincent Y. F. Tan","orcid":"https://orcid.org/0000-0002-5008-4527"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Vincent Y. F. Tan","raw_affiliation_strings":["Electrical and Computer Engineering, National University of Singapore","Electr. & Comput. Eng, Nat. Univ. of Singapore, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, National University of Singapore","institution_ids":["https://openalex.org/I165932596"]},{"raw_affiliation_string":"Electr. & Comput. Eng, Nat. Univ. of Singapore, Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029182703","display_name":"Stark C. Draper","orcid":"https://orcid.org/0000-0001-8100-5599"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Stark C. Draper","raw_affiliation_strings":["Electrical and Computer Engineering, University of Toronto","Electr. & Comput. Eng, Univ. of Toronto, Toronto, ON, Canada"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, University of Toronto","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Electr. & Comput. Eng, Univ. of Toronto, Toronto, ON, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5052329970"],"corresponding_institution_ids":["https://openalex.org/I135310074"],"apc_list":null,"apc_paid":null,"fwci":0.4187,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.667004,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"15","issue":null,"first_page":"2519","last_page":"2523"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998000264167786,"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.9998000264167786,"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9969000220298767,"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/T12122","display_name":"Physical Unclonable Functions (PUFs) and Hardware Security","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/block","display_name":"Block (permutation group theory)","score":0.6468284726142883},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6437582969665527},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35557013750076294},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3319774270057678},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33082178235054016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30730825662612915},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2792118191719055}],"concepts":[{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6468284726142883},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6437582969665527},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35557013750076294},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3319774270057678},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33082178235054016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30730825662612915},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2792118191719055}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2014.6875288","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875288","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1509953781","https://openalex.org/W2008130731","https://openalex.org/W2029927374","https://openalex.org/W2031508220","https://openalex.org/W2042212887","https://openalex.org/W2106864314","https://openalex.org/W2163446469","https://openalex.org/W2276299490","https://openalex.org/W3121602658","https://openalex.org/W6652344169","https://openalex.org/W6660849819"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2051487156","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793"],"abstract_inverted_index":{"We":[0,26,98,112],"study":[1,76],"achievability":[2,119],"bounds":[3],"for":[4,50],"a":[5,77,86,93,129],"class":[6,84],"of":[7,18,53,71,134],"unequal":[8,21],"error":[9],"protection":[10,23,91],"codebooks":[11],"with":[12],"m":[13],">":[14],"1":[15],"different":[16],"classes":[17],"codewords":[19],"called":[20],"message":[22,83],"(UMP)":[24],"codes.":[25,73,136],"extend":[27],"the":[28,51,68,82],"dependence":[29],"testing":[30],"bound":[31,120],"due":[32],"to":[33,35,38,45,67,131],"Polyanskiy-Poor-Verd\u00fa":[34],"be":[36,122],"applicable":[37],"UMP":[39,72,118,135],"codes":[40,55],"and":[41],"use":[42],"this":[43,103],"extension":[44],"obtain":[46],"refined":[47],"asymptotic":[48],"expansions":[49],"performance":[52],"such":[54],"over":[56],"discrete":[57],"memoryless":[58],"channels.":[59],"In":[60],"addition,":[61],"we":[62,75],"consider":[63],"two":[64],"questions":[65],"related":[66],"practical":[69],"construction":[70,79,104],"First,":[74],"\u201cheader\u201d":[78],"that":[80,115],"prefixes":[81],"into":[85],"header":[87],"followed":[88],"by":[89],"data":[90],"using":[92,124],"standard":[94],"homogeneous":[95],"(classical)":[96],"code.":[97],"show":[99],"that,":[100],"in":[101],"general,":[102],"is":[105],"not":[106],"optimal":[107],"at":[108],"finite":[109],"block":[110],"lengths.":[111],"further":[113],"demonstrate":[114],"our":[116],"main":[117],"can":[121],"obtained":[123],"coset":[125],"codes,":[126],"which":[127],"suggests":[128],"path":[130],"tractable":[132],"implementation":[133]},"counts_by_year":[{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
