{"id":"https://openalex.org/W2179066043","doi":"https://doi.org/10.1109/isit.2004.1365044","title":"Distance properties of expander codes","display_name":"Distance properties of expander codes","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2179066043","doi":"https://doi.org/10.1109/isit.2004.1365044","mag":"2179066043"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365044","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365044","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. 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/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":["Department of ECE, University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department 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/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":false,"raw_author_name":"G. Zemor","raw_affiliation_strings":["Department of ECE, University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of ECE, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"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.2491,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.68592745,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"7","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T12029","display_name":"DNA and Biological Computing","score":0.9975000023841858,"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"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9958000183105469,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.8143872022628784},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.7426226139068604},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.674979031085968},{"id":"https://openalex.org/keywords/expander-code","display_name":"Expander code","score":0.6248612999916077},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5582764148712158},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.5254444479942322},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5194680094718933},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5141046643257141},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.507698655128479},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.49067533016204834},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4772493839263916},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.44321349263191223},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4309895634651184},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.416909784078598},{"id":"https://openalex.org/keywords/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.4164605438709259},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.28721126914024353},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2807336449623108},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2374970018863678},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.1855734884738922},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.06917646527290344}],"concepts":[{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.8143872022628784},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.7426226139068604},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.674979031085968},{"id":"https://openalex.org/C108509264","wikidata":"https://www.wikidata.org/wiki/Q5420758","display_name":"Expander code","level":5,"score":0.6248612999916077},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5582764148712158},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.5254444479942322},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5194680094718933},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5141046643257141},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.507698655128479},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.49067533016204834},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4772493839263916},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.44321349263191223},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4309895634651184},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.416909784078598},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.4164605438709259},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.28721126914024353},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2807336449623108},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2374970018863678},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.1855734884738922},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.06917646527290344},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"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":1,"locations":[{"id":"doi:10.1109/isit.2004.1365044","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365044","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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":17,"referenced_works":["https://openalex.org/W1965084720","https://openalex.org/W1970912697","https://openalex.org/W1976052006","https://openalex.org/W2051569409","https://openalex.org/W2068096733","https://openalex.org/W2098666072","https://openalex.org/W2103160098","https://openalex.org/W2122270497","https://openalex.org/W2128765501","https://openalex.org/W2130458083","https://openalex.org/W2133068391","https://openalex.org/W2138236884","https://openalex.org/W2159193690","https://openalex.org/W2165005000","https://openalex.org/W2170758137","https://openalex.org/W2171486154","https://openalex.org/W2293231900"],"related_works":["https://openalex.org/W2179066043","https://openalex.org/W2952543609","https://openalex.org/W2140148797","https://openalex.org/W4321056950","https://openalex.org/W2949789721","https://openalex.org/W2567264041","https://openalex.org/W1996596762","https://openalex.org/W2135099985","https://openalex.org/W4386907209","https://openalex.org/W1520899630"],"abstract_inverted_index":{"A":[0],"constructive":[1],"family":[2],"of":[3,30,34],"expander":[4],"codes":[5,36,46],"is":[6,40,55],"presented":[7],"whose":[8],"minimum":[9,28,48],"distance":[10,29,49],"exceeds":[11],"the":[12,27,44,52,61],"product":[13],"(Zyablov)":[14],"bound":[15],"for":[16],"all":[17],"code":[18,54],"rates":[19],"between":[20],"0":[21],"and":[22,26,58],"1.":[23],"Weight":[24],"spectrum":[25],"a":[31],"random":[32],"ensemble":[33],"bipartite-graph":[35],"are":[37],"computed.":[38],"It":[39],"shown":[41],"that":[42],"if":[43],"vertex":[45],"have":[47],"/spl":[50],"ges/3,":[51],"overall":[53],"asymptotically":[56],"good,":[57],"sometimes":[59],"meets":[60],"Gilbert-Varshamov":[62],"bound.":[63]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}