{"id":"https://openalex.org/W2025118595","doi":"https://doi.org/10.1109/isit.2005.1523555","title":"Multilevel expander codes","display_name":"Multilevel expander codes","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2025118595","doi":"https://doi.org/10.1109/isit.2005.1523555","mag":"2025118595"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523555","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523555","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","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/A5004622357","display_name":"Alexander Barg","orcid":"https://orcid.org/0000-0002-8972-4413"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"A. Barg","raw_affiliation_strings":["Dept. of ECE, University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of ECE, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"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/I12356871","display_name":"T\u00e9l\u00e9com Paris","ror":"https://ror.org/01naq7912","country_code":"FR","type":"education","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"G. Zemor","raw_affiliation_strings":["Ecole Nationale Superieure des T\u00e9l\u00e9communications, France"],"affiliations":[{"raw_affiliation_string":"Ecole Nationale Superieure des T\u00e9l\u00e9communications, France","institution_ids":["https://openalex.org/I12356871"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004622357"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.2595,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63331446,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":null,"first_page":"1315","last_page":"1319"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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/T11130","display_name":"Coding theory and cryptography","score":0.9995999932289124,"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/T12029","display_name":"DNA and Biological Computing","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7319718599319458},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6712698340415955},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.6509422063827515},{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.6478182077407837},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5645155906677246},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4565138816833496},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44305911660194397},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.43089744448661804},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4244050085544586},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3875565528869629}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7319718599319458},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6712698340415955},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.6509422063827515},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.6478182077407837},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5645155906677246},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4565138816833496},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44305911660194397},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.43089744448661804},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4244050085544586},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3875565528869629},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2005.1523555","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523555","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1965084720","https://openalex.org/W1970912697","https://openalex.org/W2068096733","https://openalex.org/W2115172843","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2138236884","https://openalex.org/W2171486154","https://openalex.org/W2293231900","https://openalex.org/W2567264041","https://openalex.org/W4300188436"],"related_works":["https://openalex.org/W2154392321","https://openalex.org/W3133831695","https://openalex.org/W2037763716","https://openalex.org/W2100149990","https://openalex.org/W1968396483","https://openalex.org/W4297536019","https://openalex.org/W2362406576","https://openalex.org/W2950636389","https://openalex.org/W1533984353","https://openalex.org/W2134931385"],"abstract_inverted_index":{"We":[0],"define":[1],"multilevel":[2,12,47],"codes":[3],"on":[4],"bipartite":[5],"graphs":[6],"which":[7],"have":[8],"properties":[9],"analogous":[10],"to":[11,28,42],"serial":[13],"concatenations.":[14],"A":[15],"linear-time":[16],"decoding":[17,58],"algorithm":[18,38,59],"is":[19],"described":[20],"that":[21,43],"corrects":[22],"a":[23,56],"proportion":[24],"of":[25,36,44],"errors":[26],"equal":[27],"half":[29],"the":[30,51],"Blokh-Zyablov":[31],"bound.":[32],"The":[33],"error":[34],"probability":[35],"this":[37],"has":[39],"exponent":[40,53],"similar":[41],"serially":[45],"concatenated":[46],"codes,":[48],"i.e.":[49],"equals":[50],"best-known":[52],"achievable":[54],"by":[55],"polynomial-time":[57]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}