{"id":"https://openalex.org/W2115172843","doi":"https://doi.org/10.1109/isit.2004.1365043","title":"On nearly-MDS expander codes","display_name":"On nearly-MDS expander codes","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2115172843","doi":"https://doi.org/10.1109/isit.2004.1365043","mag":"2115172843"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365043","is_oa":false,"landing_page_url":"http://doi.org/10.1109/isit.2004.1365043","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":"conference-paper","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/A5074098103","display_name":"Ron M. Roth","orcid":"https://orcid.org/0000-0003-4168-9505"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"R.M. Roth","raw_affiliation_strings":["Computer Science Department Technion Haifa Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department Technion Haifa Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048122752","display_name":"Vitaly Skachek","orcid":"https://orcid.org/0000-0002-0626-2437"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"V. Skachek","raw_affiliation_strings":["Computer Science Department Technion Haifa Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department Technion Haifa Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":1.993,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.87241493,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"6","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","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/T11130","display_name":"Coding theory and cryptography","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/T12162","display_name":"Cellular Automata and Applications","score":0.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/expander-code","display_name":"Expander code","score":0.598363995552063},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5768032073974609},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5624295473098755},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5548740029335022},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5514119267463684},{"id":"https://openalex.org/keywords/singleton","display_name":"Singleton","score":0.530758798122406},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5089457035064697},{"id":"https://openalex.org/keywords/raptor-code","display_name":"Raptor code","score":0.4978928565979004},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48446059226989746},{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.4642331004142761},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4535669684410095},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.43937334418296814},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4216967225074768},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3804226517677307},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3712804317474365},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.36740922927856445},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3651803135871887}],"concepts":[{"id":"https://openalex.org/C108509264","wikidata":"https://www.wikidata.org/wiki/Q5420758","display_name":"Expander code","level":5,"score":0.598363995552063},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5768032073974609},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5624295473098755},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5548740029335022},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5514119267463684},{"id":"https://openalex.org/C117354338","wikidata":"https://www.wikidata.org/wiki/Q1165112","display_name":"Singleton","level":3,"score":0.530758798122406},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5089457035064697},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.4978928565979004},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48446059226989746},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.4642331004142761},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4535669684410095},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.43937334418296814},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4216967225074768},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3804226517677307},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3712804317474365},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.36740922927856445},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3651803135871887},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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/C2779234561","wikidata":"https://www.wikidata.org/wiki/Q11995","display_name":"Pregnancy","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2004.1365043","is_oa":false,"landing_page_url":"http://doi.org/10.1109/isit.2004.1365043","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.342.2724","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.2724","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0601090v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.390.62","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.390.62","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://shannoninstitute.ucd.ie/~vitalys/Papers/Nearly-MDS/nearly-mds-expander.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1970912697","https://openalex.org/W2068096733","https://openalex.org/W2138236884","https://openalex.org/W2171486154","https://openalex.org/W4205733861"],"related_works":["https://openalex.org/W2121145816","https://openalex.org/W2293231900","https://openalex.org/W3141193846","https://openalex.org/W2095450438","https://openalex.org/W165186219","https://openalex.org/W4365505990","https://openalex.org/W4305014099","https://openalex.org/W2163381101","https://openalex.org/W2133690701","https://openalex.org/W4237217078"],"abstract_inverted_index":{"A":[0],"construction":[1,86],"of":[2,48,81],"expander":[3],"codes":[4,14,56,61,72],"is":[5,30,110],"presented":[6,85],"with":[7],"the":[8,13,18,49,55,75,79,107],"following":[9],"three":[10],"properties:":[11],"(i)":[12],"lie":[15],"close":[16],"to":[17],"Singleton":[19,108],"bound,":[20],"(ii)":[21],"they":[22,38],"can":[23,57],"be":[24],"encoded":[25],"in":[26,32,62,67,96],"time":[27],"complexity":[28],"that":[29,51,73,97,104],"linear":[31],"their":[33],"code":[34],"length,":[35],"and":[36,70,94,100],"(iii)":[37],"have":[39],"a":[40,46,113],"linear-time":[41,68],"bounded-distance":[42],"decoder.":[43],"By":[44],"using":[45],"version":[47],"decoder":[50],"corrects":[52],"also":[53],"erasures,":[54],"replace":[58],"MDS":[59],"outer":[60],"concatenated":[63],"constructions,":[64],"thus":[65],"resulting":[66],"encodable":[69],"decodable":[71],"approach":[74],"Zyablov":[76],"bound":[77,109],"or":[78],"capacity":[80],"memoryless":[82],"channels.":[83],"The":[84],"improves":[87],"on":[88],"an":[89],"earlier":[90],"result":[91],"by":[92],"Guruswami":[93],"Indyk":[95],"any":[98],"rate":[99],"relative":[101],"minimum":[102],"distance":[103],"lies":[105],"below":[106],"attainable":[111],"for":[112],"significantly":[114],"smaller":[115],"alphabet":[116],"size.":[117]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}