{"id":"https://openalex.org/W2975998570","doi":"https://doi.org/10.1109/isit.2019.8849713","title":"Optimal Age over Erasure Channels","display_name":"Optimal Age over Erasure Channels","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2975998570","doi":"https://doi.org/10.1109/isit.2019.8849713","mag":"2975998570"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849713","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849713","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/handle/20.500.14299/162380","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034444117","display_name":"Elie Najm","orcid":"https://orcid.org/0000-0002-3911-3382"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Elie Najm","raw_affiliation_strings":["LTHI, EPFL, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LTHI, EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025506109","display_name":"Emre Telatar","orcid":"https://orcid.org/0009-0007-5365-5368"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Emre Telatar","raw_affiliation_strings":["LTHI, EPFL, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LTHI, EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054758065","display_name":"Rajai Nasser","orcid":"https://orcid.org/0000-0003-0057-1201"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rajai Nasser","raw_affiliation_strings":["AUB, Beirut, Lebanon"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AUB, Beirut, Lebanon","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.009,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.97819262,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"335","last_page":"339"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":1.0,"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/T13553","display_name":"Age of Information Optimization","score":1.0,"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/T12079","display_name":"IoT Networks and Protocols","score":0.9787999987602234,"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/T10300","display_name":"Congenital Heart Disease Studies","score":0.97079998254776,"subfield":{"id":"https://openalex.org/subfields/2713","display_name":"Epidemiology"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.6483871936798096},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.6331954002380371},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5929115414619446},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.5765419602394104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5433377623558044},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5420755743980408},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5183983445167542},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5053489804267883},{"id":"https://openalex.org/keywords/observer","display_name":"Observer (physics)","score":0.4762192666530609},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40146344900131226},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3978833556175232},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3570566177368164},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3311622142791748},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.29865914583206177},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.2882111370563507},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.12102863192558289},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.07226398587226868}],"concepts":[{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.6483871936798096},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.6331954002380371},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5929115414619446},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.5765419602394104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5433377623558044},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5420755743980408},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5183983445167542},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5053489804267883},{"id":"https://openalex.org/C2780704645","wikidata":"https://www.wikidata.org/wiki/Q9251458","display_name":"Observer (physics)","level":2,"score":0.4762192666530609},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40146344900131226},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3978833556175232},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3570566177368164},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3311622142791748},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.29865914583206177},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.2882111370563507},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.12102863192558289},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.07226398587226868},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2019.8849713","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849713","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:infoscience.epfl.ch:271642","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/162380","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:271642","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/162380","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"},"sustainable_development_goals":[{"display_name":"Quality Education","score":0.7699999809265137,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1993918491","https://openalex.org/W2146487252","https://openalex.org/W2155677847","https://openalex.org/W2296743432","https://openalex.org/W2345637103","https://openalex.org/W2612100624","https://openalex.org/W2907267104","https://openalex.org/W2963869148","https://openalex.org/W2964222997","https://openalex.org/W2975998570"],"related_works":["https://openalex.org/W2372190485","https://openalex.org/W2139769859","https://openalex.org/W2583282232","https://openalex.org/W2140357074","https://openalex.org/W2002203372","https://openalex.org/W2113562070","https://openalex.org/W2810502498","https://openalex.org/W2743670993","https://openalex.org/W2028268383","https://openalex.org/W2809708642"],"abstract_inverted_index":{"Given":[0],"a":[1,5,69,76],"source":[2,53,117],"that":[3,13,26,33,44,68,101],"produces":[4],"letter":[6],"every":[7,17],"Tsseconds":[8],"and":[9,54,75,99],"an":[10,34],"erasure":[11],"channel":[12,38],"can":[14],"be":[15,84],"used":[16],"Tcseconds,":[18],"we":[19,66,89],"ask":[20],"what":[21],"is":[22,73],"the":[23,28,37,49,52,63,81,87,96,102,111,116],"coding":[24,71,92],"strategy":[25,72],"minimizes":[27],"time-average":[29],"\"age":[30],"of":[31,36],"information\"":[32],"observer":[35],"output":[39],"incurs.":[40],"We":[41],"will":[42],"see":[43],"one":[45],"has":[46],"to":[47,94,110],"distinguish":[48],"cases":[50],"when":[51],"channel-input":[55],"alphabets":[56],"have":[57],"equal":[58],"or":[59],"different":[60],"size.":[61],"In":[62,86],"first":[64],"case,":[65],"show":[67,100],"trivial":[70],"optimal":[74,112],"closed":[77],"form":[78],"expression":[79],"for":[80],"age":[82,98,104,114],"may":[83],"derived.":[85],"second,":[88],"use":[90],"random":[91,107],"argument":[93],"bound":[95],"average":[97,103,113],"achieved":[105],"using":[106],"codes":[108],"converges":[109],"as":[115],"alphabet":[118],"becomes":[119],"large.":[120]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":5}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}