{"id":"https://openalex.org/W4415367405","doi":"https://doi.org/10.1109/isit63088.2025.11195316","title":"Efficient Covering Using Reed-Solomon Codes","display_name":"Efficient Covering Using Reed-Solomon Codes","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367405","doi":"https://doi.org/10.1109/isit63088.2025.11195316"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195316","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195316","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/A5065204703","display_name":"Samin Riasat","orcid":"https://orcid.org/0000-0002-8821-2723"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Samin Riasat","raw_affiliation_strings":["Northeastern University,Department of Electrical and Computer Engineering,Boston,MA,USA,02115"],"affiliations":[{"raw_affiliation_string":"Northeastern University,Department of Electrical and Computer Engineering,Boston,MA,USA,02115","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056299839","display_name":"Hessam Mahdavifar","orcid":"https://orcid.org/0000-0001-9021-1992"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hessam Mahdavifar","raw_affiliation_strings":["Northeastern University,Department of Electrical and Computer Engineering,Boston,MA,USA,02115"],"affiliations":[{"raw_affiliation_string":"Northeastern University,Department of Electrical and Computer Engineering,Boston,MA,USA,02115","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065204703"],"corresponding_institution_ids":["https://openalex.org/I12912129"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16434185,"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/T11130","display_name":"Coding theory and cryptography","score":0.9998000264167786,"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.9998000264167786,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9943000078201294,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9732000231742859,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.765500009059906},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.729200005531311},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6703000068664551},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.6320000290870667},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6032000184059143},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.5525000095367432},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5442000031471252}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.765500009059906},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.729200005531311},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6703000068664551},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6320000290870667},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6032000184059143},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5590000152587891},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.5525000095367432},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5442000031471252},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5112000107765198},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.5091999769210815},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4629000127315521},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.34049999713897705},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33500000834465027},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3278999924659729},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3034000098705292},{"id":"https://openalex.org/C112932734","wikidata":"https://www.wikidata.org/wiki/Q2322550","display_name":"Hamming(7,4)","level":5,"score":0.29750001430511475},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.2842999994754791},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2741999924182892}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195316","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195316","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1557598034","https://openalex.org/W2017162528","https://openalex.org/W2120847027","https://openalex.org/W2122685617","https://openalex.org/W2126655674","https://openalex.org/W2157562358","https://openalex.org/W2973556000","https://openalex.org/W3196982456","https://openalex.org/W4206748557","https://openalex.org/W4206775542","https://openalex.org/W4401692833","https://openalex.org/W4414539024"],"related_works":[],"abstract_inverted_index":{"We":[0,76],"propose":[1],"an":[2],"efficient":[3],"algorithm":[4,54,65,72,89],"to":[5,44,112],"find":[6],"a":[7,12],"ReedSolomon":[8],"(RS)":[9],"codeword":[10],"at":[11,118],"distance":[13],"within":[14],"the":[15,19,30,33,38,46,63,70,84,87,93,105,113,119,124],"covering":[16,47,95],"radius":[17,96,110,116],"of":[18,32,41,86,109,123],"code":[20],"from":[21,98],"any":[22],"point":[23],"in":[24,91],"its":[25,42],"ambient":[26,125],"Hamming":[27,107,126],"space.":[28,127],"To":[29],"best":[31],"authors'":[34],"knowledge,":[35],"this":[36],"is":[37],"first":[39],"attempt":[40],"kind":[43],"solve":[45],"problem":[48],"for":[49,59,66,73],"RS":[50,60],"codes.":[51],"The":[52],"proposed":[53,88],"leverages":[55],"off-the-shelf":[56],"decoding":[57,68,115],"methods":[58],"codes,":[61],"including":[62],"Berlekamp-Welch":[64],"unique":[67],"and":[69,80],"Guruswami-Sudan":[71],"list":[74],"decoding.":[75],"also":[77],"present":[78],"theoretical":[79],"numerical":[81,101],"results":[82,102],"on":[83],"capabilities":[85],"and,":[90],"particular,":[92],"average":[94],"resulting":[97],"it.":[99],"Our":[100],"suggest":[103],"that":[104],"overlapping":[106],"spheres":[108],"close":[111],"GuruswamiSudan":[114],"centered":[117],"codewords":[120],"cover":[121],"most":[122]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}