{"id":"https://openalex.org/W4289655264","doi":"https://doi.org/10.1109/isit50566.2022.9834754","title":"Evaluating the Gilbert-Varshamov Bound for Constrained Systems","display_name":"Evaluating the Gilbert-Varshamov Bound for Constrained Systems","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655264","doi":"https://doi.org/10.1109/isit50566.2022.9834754"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834754","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834754","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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/A5036810549","display_name":"Keshav Goyal","orcid":"https://orcid.org/0000-0003-3027-9789"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Goyal Keshav","raw_affiliation_strings":["Nanyang Technological University,School of Physical and Mathematical Sciences,Singapore","School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University,School of Physical and Mathematical Sciences,Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083157397","display_name":"Han Mao Kiah","orcid":"https://orcid.org/0000-0001-5611-0848"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Han Mao Kiah","raw_affiliation_strings":["Nanyang Technological University,School of Physical and Mathematical Sciences,Singapore","School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University,School of Physical and Mathematical Sciences,Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036810549"],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":0.2144,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.30535895,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1348","last_page":"1353"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9958000183105469,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9944000244140625,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.651549756526947},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5411964654922485},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5010108947753906},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.383078396320343},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34726664423942566},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34226319193840027}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.651549756526947},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5411964654922485},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5010108947753906},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.383078396320343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34726664423942566},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34226319193840027},{"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/isit50566.2022.9834754","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834754","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320311687","display_name":"Ministry of Education","ror":"https://ror.org/03m01yf64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W636820564","https://openalex.org/W1969691134","https://openalex.org/W1977781091","https://openalex.org/W2009712582","https://openalex.org/W2033638166","https://openalex.org/W2071609006","https://openalex.org/W2098922615","https://openalex.org/W2135622428","https://openalex.org/W2151286572","https://openalex.org/W2160997130","https://openalex.org/W2963561675","https://openalex.org/W2964300972","https://openalex.org/W3022200423","https://openalex.org/W3080116245","https://openalex.org/W3130024018","https://openalex.org/W3163272699","https://openalex.org/W3184008446","https://openalex.org/W3197408514","https://openalex.org/W4249667877","https://openalex.org/W6680116688","https://openalex.org/W6792405589"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4285140130","https://openalex.org/W3104770499","https://openalex.org/W4285677055","https://openalex.org/W1992731528","https://openalex.org/W2007843488","https://openalex.org/W1994436307","https://openalex.org/W1987021796","https://openalex.org/W2795565301","https://openalex.org/W2785349417"],"abstract_inverted_index":{"We":[0,65],"revisit":[1],"the":[2,23,35,40,63,68,77],"well-known":[3],"Gilbert-Varshamov":[4],"(GV)":[5],"bound":[6,18,42],"for":[7],"constrained":[8],"systems.":[9],"In":[10,46],"1991,":[11],"Kolesnik":[12],"and":[13,31,38,60],"Krachkovsky":[14],"showed":[15],"that":[16],"GV":[17,41],"can":[19,70],"be":[20,71],"determined":[21],"via":[22],"solution":[24],"of":[25],"some":[26],"optimization":[27,36,58],"problem.":[28],"Later,":[29],"Marcus":[30],"Roth":[32],"(1992)":[33],"modified":[34],"problem":[37],"improved":[39],"in":[43],"many":[44],"instances.":[45],"this":[47],"work,":[48],"we":[49,75],"provide":[50],"explicit":[51],"numerical":[52],"procedures":[53,69],"to":[54],"solve":[55],"these":[56],"two":[57],"problems":[59],"hence,":[61],"compute":[62],"bounds.":[64],"then":[66],"show":[67],"further":[72],"simplified":[73],"when":[74],"plot":[76],"respective":[78],"curves.":[79]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}