{"id":"https://openalex.org/W4415367526","doi":"https://doi.org/10.1109/isit63088.2025.11195698","title":"From Bit to Block: Decoding on Erasure Channels","display_name":"From Bit to Block: Decoding on Erasure Channels","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367526","doi":"https://doi.org/10.1109/isit63088.2025.11195698"},"language":"en","primary_location":{"id":"doi:10.1109/isit63088.2025.11195698","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195698","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","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/A5034044119","display_name":"Henry D. Pfister","orcid":"https://orcid.org/0000-0001-5521-4397"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Henry D. Pfister","raw_affiliation_strings":["Duke University"],"affiliations":[{"raw_affiliation_string":"Duke University","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051320707","display_name":"Oscar Sprumont","orcid":"https://orcid.org/0000-0002-4829-8358"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Oscar Sprumont","raw_affiliation_strings":["University of Washington"],"affiliations":[{"raw_affiliation_string":"University of Washington","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064676731","display_name":"Gilles Z\u00e9mor","orcid":"https://orcid.org/0000-0002-6041-9554"},"institutions":[{"id":"https://openalex.org/I3018323443","display_name":"Centre Hospitalier Universitaire de Bordeaux","ror":"https://ror.org/01hq89f96","country_code":"FR","type":"healthcare","lineage":["https://openalex.org/I3018323443"]},{"id":"https://openalex.org/I185839726","display_name":"Institut Universitaire de France","ror":"https://ror.org/055khg266","country_code":"FR","type":"education","lineage":["https://openalex.org/I185839726"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Gilles Z\u00e9mor","raw_affiliation_strings":["Universit&#x00E9; de Bordeaux &#x0026; Institut universitaire de France"],"affiliations":[{"raw_affiliation_string":"Universit&#x00E9; de Bordeaux &#x0026; Institut universitaire de France","institution_ids":["https://openalex.org/I185839726","https://openalex.org/I3018323443"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034044119"],"corresponding_institution_ids":["https://openalex.org/I170897317"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.31043465,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.7950999736785889,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.7950999736785889,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.7445999979972839,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.7379999756813049,"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/erasure","display_name":"Erasure","score":0.7696999907493591},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.703499972820282},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.6636000275611877},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.5723999738693237},{"id":"https://openalex.org/keywords/bit","display_name":"Bit (key)","score":0.5304999947547913},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5131999850273132},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.4837000072002411},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.46939998865127563}],"concepts":[{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.7696999907493591},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.703499972820282},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.6636000275611877},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6341000199317932},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.5723999738693237},{"id":"https://openalex.org/C117011727","wikidata":"https://www.wikidata.org/wiki/Q1278488","display_name":"Bit (key)","level":2,"score":0.5304999947547913},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5271000266075134},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5131999850273132},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.4837000072002411},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.46939998865127563},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.460999995470047},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.43650001287460327},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3474999964237213},{"id":"https://openalex.org/C92224547","wikidata":"https://www.wikidata.org/wiki/Q1673216","display_name":"Probability of error","level":2,"score":0.32679998874664307},{"id":"https://openalex.org/C194405637","wikidata":"https://www.wikidata.org/wiki/Q369367","display_name":"Repetition code","level":5,"score":0.32019999623298645},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.3093999922275543},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30550000071525574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30329999327659607},{"id":"https://openalex.org/C41431624","wikidata":"https://www.wikidata.org/wiki/Q1053357","display_name":"Block size","level":3,"score":0.3005000054836273},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.29829999804496765},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2874000072479248},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.266400009393692}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit63088.2025.11195698","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195698","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-05565894v1","is_oa":false,"landing_page_url":"https://hal.science/hal-05565894","pdf_url":null,"source":{"id":"https://openalex.org/S4406922398","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT), Jun 2025, Ann Arbor, France. IEEE, pp.1-6, 2025, &#x27E8;10.1109/ISIT63088.2025.11195698&#x27E9;","raw_type":"Proceedings"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1545614041","https://openalex.org/W1606480398","https://openalex.org/W1995875735","https://openalex.org/W2071763320","https://openalex.org/W2100856114","https://openalex.org/W2127558904","https://openalex.org/W2150498905","https://openalex.org/W2591190829","https://openalex.org/W2962970830","https://openalex.org/W3037718443","https://openalex.org/W4380679932","https://openalex.org/W4390098163"],"related_works":[],"abstract_inverted_index":{"We":[0],"provide":[1],"a":[2,12,59,69],"general":[3],"framework":[4],"for":[5,50],"bounding":[6],"the":[7,21,36,73,82],"block":[8,88],"error":[9,29,89],"threshold":[10],"of":[11,26,40,46,54,61,72],"linear":[13],"code":[14],"<tex":[15,42,47,55],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[16,43,48,56],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$C":[17],"\\subseteq":[18],"\\mathbb{F}_{2}^{N}$</tex>":[19],"over":[20],"erasure":[22,83],"channel":[23,84],"in":[24],"terms":[25],"its":[27],"bit":[28],"threshold.":[30],"Our":[31],"approach":[32],"relies":[33],"on":[34,81],"understanding":[35],"minimum":[37],"support":[38],"weight":[39],"any":[41],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$r$</tex>-dimensional":[44],"subcode":[45],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$C$</tex>,":[49],"all":[51],"small":[52],"values":[53],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$r$</tex>.":[57],"As":[58],"proof":[60,71],"concept,":[62],"we":[63],"use":[64],"our":[65],"machinery":[66],"to":[67,87],"obtain":[68],"new":[70],"celebrated":[74],"result":[75],"that":[76],"Reed-Muller":[77],"codes":[78],"achieve":[79],"capacity":[80],"with":[85],"respect":[86],"probability.":[90]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-21T00:00:00"}