{"id":"https://openalex.org/W4386082982","doi":"https://doi.org/10.1109/isit54713.2023.10206920","title":"Bounds on the Essential Covering Radius of Constrained Systems","display_name":"Bounds on the Essential Covering Radius of Constrained Systems","publication_year":2023,"publication_date":"2023-06-25","ids":{"openalex":"https://openalex.org/W4386082982","doi":"https://doi.org/10.1109/isit54713.2023.10206920"},"language":"en","primary_location":{"id":"doi:10.1109/isit54713.2023.10206920","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit54713.2023.10206920","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 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/A5018957807","display_name":"Dor Elimelech","orcid":"https://orcid.org/0000-0002-9141-8669"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Dor Elimelech","raw_affiliation_strings":["Ben-Gurion University of the Negev,Electrical and Computer Engineering,Beer Sheva,Israel,8410501"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev,Electrical and Computer Engineering,Beer Sheva,Israel,8410501","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055883859","display_name":"Tom Meyerovitch","orcid":"https://orcid.org/0000-0003-1617-0955"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Tom Meyerovitch","raw_affiliation_strings":["Ben-Gurion University of the Negev,Department of Mathematics,Beer Sheva,Israel,8410501"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev,Department of Mathematics,Beer Sheva,Israel,8410501","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054043026","display_name":"Moshe Schwartz","orcid":"https://orcid.org/0000-0002-1449-0026"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Moshe Schwartz","raw_affiliation_strings":["Ben-Gurion University of the Negev,Electrical and Computer Engineering,Beer Sheva,Israel,8410501"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev,Electrical and Computer Engineering,Beer Sheva,Israel,8410501","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5018957807"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10233764,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2679","last_page":"2684"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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.9951000213623047,"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/T12029","display_name":"DNA and Biological Computing","score":0.9930999875068665,"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/radius","display_name":"RADIUS","score":0.7041352987289429},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.5688930153846741},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5425262451171875},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5339697003364563},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5254473090171814},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5176804065704346},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5088493824005127},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.45240339636802673},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4131055474281311},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3616619408130646},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3604505658149719},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20545026659965515},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07448163628578186},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06254905462265015}],"concepts":[{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.7041352987289429},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.5688930153846741},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5425262451171875},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5339697003364563},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5254473090171814},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5176804065704346},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5088493824005127},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.45240339636802673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4131055474281311},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3616619408130646},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3604505658149719},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20545026659965515},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07448163628578186},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06254905462265015},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit54713.2023.10206920","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit54713.2023.10206920","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 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":11,"referenced_works":["https://openalex.org/W1969335396","https://openalex.org/W1974382727","https://openalex.org/W1983491218","https://openalex.org/W2043854093","https://openalex.org/W2128440011","https://openalex.org/W2158485608","https://openalex.org/W3010362682","https://openalex.org/W3137275360","https://openalex.org/W4211250540","https://openalex.org/W4386075108","https://openalex.org/W6792794548"],"related_works":["https://openalex.org/W2373577936","https://openalex.org/W3095575180","https://openalex.org/W2389596151","https://openalex.org/W4221148444","https://openalex.org/W4226054107","https://openalex.org/W2379651310","https://openalex.org/W2113019827","https://openalex.org/W1541249122","https://openalex.org/W2413828414","https://openalex.org/W2367222340"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"applications":[2],"for":[3],"error-correcting":[4],"constrained":[5,14,31],"codes,":[6,60],"we":[7,65],"study":[8],"the":[9,20,35,39,51],"essential":[10,21,52],"covering":[11,22,53],"radius":[12,23,54],"of":[13,30,38],"systems.":[15],"In":[16],"a":[17],"recent":[18],"work,":[19],"was":[24],"suggested":[25],"as":[26],"new":[27],"fundamental":[28],"parameter":[29],"systems":[32],"that":[33],"characterizes":[34],"error-correction":[36],"capabilities":[37],"quantized-constraint":[40],"concatenation":[41],"(QCC)":[42],"scheme.":[43],"We":[44],"provide":[45],"general":[46],"efficiently":[47],"computable":[48],"upper-bounds":[49],"on":[50],"using":[55],"Markov":[56],"chains":[57],"and":[58],"sliding-block":[59],"which":[61],"in":[62],"some":[63],"cases,":[64],"show":[66],"to":[67],"be":[68],"tight.":[69]},"counts_by_year":[],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}