{"id":"https://openalex.org/W2144431286","doi":"https://doi.org/10.1109/isit.2012.6284236","title":"Biff (Bloom filter) codes: Fast error correction for large data sets","display_name":"Biff (Bloom filter) codes: Fast error correction for large data sets","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2144431286","doi":"https://doi.org/10.1109/isit.2012.6284236","mag":"2144431286"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2012.6284236","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6284236","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","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/A5062318856","display_name":"Michael Mitzenmacher","orcid":"https://orcid.org/0000-0001-5430-5457"},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Mitzenmacher","raw_affiliation_strings":["School of Engineering and Applied Sciences, Harvard University, USA","Harvard University.,School of Engineering and Applied Sciences"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Applied Sciences, Harvard University, USA","institution_ids":["https://openalex.org/I136199984"]},{"raw_affiliation_string":"Harvard University.,School of Engineering and Applied Sciences","institution_ids":["https://openalex.org/I136199984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102730096","display_name":"George Varghese","orcid":"https://orcid.org/0000-0002-8218-5701"},"institutions":[{"id":"https://openalex.org/I2800095910","display_name":"Yahoo (Spain)","ror":"https://ror.org/03gq8sg42","country_code":"ES","type":"company","lineage":["https://openalex.org/I2800095910","https://openalex.org/I4210134091"]},{"id":"https://openalex.org/I4210134091","display_name":"Yahoo (United States)","ror":"https://ror.org/040dkzz12","country_code":"US","type":"company","lineage":["https://openalex.org/I4210134091"]}],"countries":["ES","US"],"is_corresponding":false,"raw_author_name":"George Varghese","raw_affiliation_strings":["Yahoo Laboratories, UCSD CSE, USA","UCSD CSE and Yahoo Labs"],"affiliations":[{"raw_affiliation_string":"Yahoo Laboratories, UCSD CSE, USA","institution_ids":["https://openalex.org/I4210134091"]},{"raw_affiliation_string":"UCSD CSE and Yahoo Labs","institution_ids":["https://openalex.org/I2800095910"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062318856"],"corresponding_institution_ids":["https://openalex.org/I136199984"],"apc_list":null,"apc_paid":null,"fwci":6.3828,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.9690849,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9995999932289124,"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/T11478","display_name":"Caching and Content Delivery","score":0.9995999932289124,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9912999868392944,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9868000149726868,"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/bloom-filter","display_name":"Bloom filter","score":0.8122105598449707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7989078164100647},{"id":"https://openalex.org/keywords/tornado-code","display_name":"Tornado code","score":0.608387291431427},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5406154990196228},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5121362209320068},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48545581102371216},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4541054666042328},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4506804645061493},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4462067186832428},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.444713830947876},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.4403541088104248},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3101631999015808},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.28623276948928833},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09037435054779053}],"concepts":[{"id":"https://openalex.org/C147224247","wikidata":"https://www.wikidata.org/wiki/Q885373","display_name":"Bloom filter","level":2,"score":0.8122105598449707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7989078164100647},{"id":"https://openalex.org/C65058987","wikidata":"https://www.wikidata.org/wiki/Q7826005","display_name":"Tornado code","level":5,"score":0.608387291431427},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5406154990196228},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5121362209320068},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48545581102371216},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4541054666042328},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4506804645061493},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4462067186832428},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.444713830947876},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.4403541088104248},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3101631999015808},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.28623276948928833},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09037435054779053}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2012.6284236","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6284236","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1483799883","https://openalex.org/W1528625750","https://openalex.org/W1979795732","https://openalex.org/W2013592197","https://openalex.org/W2014586253","https://openalex.org/W2026357470","https://openalex.org/W2037633400","https://openalex.org/W2043020364","https://openalex.org/W2043465005","https://openalex.org/W2084817433","https://openalex.org/W2112858600","https://openalex.org/W2115104320","https://openalex.org/W2133225898","https://openalex.org/W2142423295","https://openalex.org/W6631482757","https://openalex.org/W6645430912","https://openalex.org/W6671666448"],"related_works":["https://openalex.org/W1564712904","https://openalex.org/W1606491530","https://openalex.org/W2178463917","https://openalex.org/W2623698249","https://openalex.org/W2129541134","https://openalex.org/W2156338408","https://openalex.org/W2951621017","https://openalex.org/W2011343125","https://openalex.org/W2401693723","https://openalex.org/W1891810191"],"abstract_inverted_index":{"Large":[0],"data":[1,34,171],"sets":[2],"are":[3,17,20,74,80,116,121,127,137],"increasingly":[4],"common":[5],"in":[6,36,222],"cloud":[7,51],"and":[8,79,94,108,148,199],"virtualized":[9],"environments.":[10],"For":[11,85],"example,":[12],"transfers":[13],"of":[14,23,44,91,132,202,214,220],"multiple":[15],"gigabytes":[16],"commonplace,":[18],"as":[19],"replicated":[21],"blocks":[22],"such":[24,37,50],"sizes.":[25],"There":[26],"is":[27,46,100,104,112,181,190],"a":[28,89,159,163,168,208,225],"need":[29],"for":[30,59,82,129,167],"fast":[31],"error-correction":[32,56],"or":[33],"reconciliation":[35,52,165],"settings":[38],"even":[39],"when":[40],"the":[41,97,109,178,191,200],"expected":[42],"number":[43],"errors":[45,130,221],"small.":[47],"Motivated":[48],"by":[49,158],"problems,":[53],"we":[54],"consider":[55],"schemes":[57],"designed":[58,81,128,138],"large":[60,83],"data,":[61],"after":[62],"explaining":[63],"why":[64],"previous":[65],"approaches":[66],"appear":[67],"unsuitable.":[68],"We":[69,154,204],"introduce":[70],"Biff":[71,86,114,135,156],"codes,":[72,125],"which":[73,194],"based":[75,149],"on":[76,151],"Bloom":[77,174],"filters":[78],"data.":[84],"codes":[87,115,136,157],"with":[88,193,218],"message":[90],"length":[92],"L":[93],"E":[95],"errors,":[96],"encoding":[98],"time":[99,103],"O(L),":[101],"decoding":[102],"O(L":[105],"+":[106],"E)":[107],"space":[110],"overhead":[111],"O(E).":[113],"low-density":[117],"parity-check":[118],"codes;":[119],"they":[120],"similar":[122],"to":[123,139],"Tornado":[124],"but":[126],"instead":[131],"erasures.":[133],"Further,":[134],"be":[140,197],"very":[141],"simple,":[142,183],"removing":[143],"any":[144],"explicit":[145],"graph":[146],"structures":[147],"entirely":[150],"hash":[152],"tables.":[153,176],"derive":[155],"simple":[160],"reduction":[161],"from":[162,207],"set":[164],"algorithm":[166],"recently":[169],"developed":[170],"structure,":[172],"invertible":[173],"lookup":[175],"While":[177],"underlying":[179],"theory":[180],"extremely":[182],"what":[184],"makes":[185],"this":[186],"code":[187],"especially":[188],"attractive":[189],"ease":[192],"it":[195],"can":[196],"implemented":[198],"speed":[201],"decoding.":[203],"present":[205],"results":[206],"prototype":[209],"implementation":[210],"that":[211],"decodes":[212],"messages":[213],"1":[215],"million":[216],"words":[217],"thousands":[219],"well":[223],"under":[224],"second.":[226]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}