{"id":"https://openalex.org/W1973613668","doi":"https://doi.org/10.1109/infcom.2012.6195624","title":"A simpler and better design of error estimating coding","display_name":"A simpler and better design of error estimating coding","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W1973613668","doi":"https://doi.org/10.1109/infcom.2012.6195624","mag":"1973613668"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2012.6195624","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2012.6195624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Proceedings IEEE INFOCOM","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/A5103178693","display_name":"Nan Hua","orcid":"https://orcid.org/0000-0001-8021-9675"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nan Hua","raw_affiliation_strings":["School of CS, Georgia Tech, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of CS, Georgia Tech, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085185917","display_name":"Ashwin Lall","orcid":"https://orcid.org/0009-0003-2046-0055"},"institutions":[{"id":"https://openalex.org/I20577493","display_name":"Denison University","ror":"https://ror.org/05pqx1c24","country_code":"US","type":"education","lineage":["https://openalex.org/I20577493"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ashwin Lall","raw_affiliation_strings":["Department of Math and CS, Denison University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Math and CS, Denison University, USA","institution_ids":["https://openalex.org/I20577493"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083596391","display_name":"Baochun Li","orcid":"https://orcid.org/0000-0003-2404-0974"},"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":"Baochun Li","raw_affiliation_strings":["Department of ECE, University of Toronto, Canada","Department of ECE, University of Toronto, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of ECE, University of Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Department of ECE, University of Toronto, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025728584","display_name":"Jun Xu","orcid":"https://orcid.org/0000-0002-0046-8119"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jun Xu","raw_affiliation_strings":["School of CS, Georgia Tech, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of CS, Georgia Tech, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.096,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.91425002,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"235","last_page":"243"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sketch","display_name":"Sketch","score":0.936684250831604},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7474185228347778},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6945145726203918},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5531154274940491},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.513538122177124},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46622446179389954},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.4535851776599884},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4408864974975586},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4117674231529236},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3817945420742035},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21021270751953125},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09971332550048828}],"concepts":[{"id":"https://openalex.org/C2779231336","wikidata":"https://www.wikidata.org/wiki/Q7534724","display_name":"Sketch","level":2,"score":0.936684250831604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7474185228347778},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6945145726203918},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5531154274940491},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.513538122177124},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46622446179389954},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.4535851776599884},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4408864974975586},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4117674231529236},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3817945420742035},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21021270751953125},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09971332550048828},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/infcom.2012.6195624","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2012.6195624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.305.2170","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.305.2170","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://iqua.ece.toronto.edu/~bli/papers/eec-infocom12.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.306.8196","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.306.8196","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://personal.denison.edu/~lalla/eec-infocom2012.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W605043455","https://openalex.org/W1534925464","https://openalex.org/W1965972569","https://openalex.org/W1980223785","https://openalex.org/W1995484833","https://openalex.org/W1998272044","https://openalex.org/W2025051251","https://openalex.org/W2040063291","https://openalex.org/W2045533739","https://openalex.org/W2053376180","https://openalex.org/W2080234606","https://openalex.org/W2163964823","https://openalex.org/W2340787257","https://openalex.org/W4254355229","https://openalex.org/W6632090173"],"related_works":["https://openalex.org/W2378994405","https://openalex.org/W2385974820","https://openalex.org/W2373478030","https://openalex.org/W2378679551","https://openalex.org/W3149739944","https://openalex.org/W2392363776","https://openalex.org/W2063051341","https://openalex.org/W2008268605","https://openalex.org/W1557064786","https://openalex.org/W1647069448"],"abstract_inverted_index":{"We":[0,21,57],"study":[1],"error":[2,75],"estimating":[3],"codes":[4],"with":[5],"the":[6,13,23,36,64,70],"goal":[7],"of":[8,18,25,46,63],"establishing":[9],"better":[10],"bounds":[11],"for":[12,30,73],"theoretical":[14,78],"and":[15,33,80],"empirical":[16],"overhead":[17,72],"such":[19],"schemes.":[20],"explore":[22],"idea":[24],"using":[26,51],"sketch":[27,38,66],"data":[28],"structures":[29],"this":[31],"problem,":[32],"show":[34],"that":[35,67],"tug-of-war":[37,65],"gives":[39],"an":[40],"asymptotically":[41],"optimal":[42],"solution.":[43],"The":[44],"optimality":[45],"our":[47],"algorithms":[48],"are":[49,82],"proved":[50],"communication":[52,71],"complexity":[53],"lower":[54],"bound":[55],"techniques.":[56],"then":[58],"propose":[59],"a":[60],"novel":[61],"enhancement":[62],"greatly":[68],"reduces":[69],"realistic":[74],"rates.":[76],"Our":[77],"analysis":[79],"assertions":[81],"supported":[83],"by":[84],"extensive":[85],"experimental":[86],"evaluation.":[87]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}