{"id":"https://openalex.org/W4386075096","doi":"https://doi.org/10.1109/isit54713.2023.10206742","title":"Bounds on Size of Homopolymer Free Codes","display_name":"Bounds on Size of Homopolymer Free Codes","publication_year":2023,"publication_date":"2023-06-25","ids":{"openalex":"https://openalex.org/W4386075096","doi":"https://doi.org/10.1109/isit54713.2023.10206742"},"language":"en","primary_location":{"id":"doi:10.1109/isit54713.2023.10206742","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit54713.2023.10206742","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/A5061648031","display_name":"Krishna Gopal Benerjee","orcid":"https://orcid.org/0000-0003-2765-2263"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Krishna Gopal Benerjee","raw_affiliation_strings":["Indian Institute of Technology Kanpur,Department of Electrical Engineering,India","Department of Electrical Engineering, Indian Institute of Technology Kanpur, India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Kanpur,Department of Electrical Engineering,India","institution_ids":["https://openalex.org/I94234084"]},{"raw_affiliation_string":"Department of Electrical Engineering, Indian Institute of Technology Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029924040","display_name":"Adrish Banerjee","orcid":"https://orcid.org/0000-0001-6646-8464"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Adrish Banerjee","raw_affiliation_strings":["Indian Institute of Technology Kanpur,Department of Electrical Engineering,India","Department of Electrical Engineering, Indian Institute of Technology Kanpur, India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Kanpur,Department of Electrical Engineering,India","institution_ids":["https://openalex.org/I94234084"]},{"raw_affiliation_string":"Department of Electrical Engineering, Indian Institute of Technology Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061648031"],"corresponding_institution_ids":["https://openalex.org/I94234084"],"apc_list":null,"apc_paid":null,"fwci":0.3185,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63899228,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"809","last_page":"814"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":1.0,"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/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9993000030517578,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9883999824523926,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7745505571365356},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.7163833379745483},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7014291286468506},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.683837354183197},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6526330709457397},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6403343677520752},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.6029945611953735},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4974980652332306},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44708895683288574},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.23273581266403198},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21520879864692688},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20780235528945923},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.13562878966331482}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7745505571365356},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.7163833379745483},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7014291286468506},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.683837354183197},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6526330709457397},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6403343677520752},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.6029945611953735},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4974980652332306},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44708895683288574},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.23273581266403198},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21520879864692688},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20780235528945923},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.13562878966331482},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/isit54713.2023.10206742","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit54713.2023.10206742","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":[{"score":0.7599999904632568,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1498820893","https://openalex.org/W1964876021","https://openalex.org/W2025383314","https://openalex.org/W2047803590","https://openalex.org/W2074993099","https://openalex.org/W2096501452","https://openalex.org/W2098922615","https://openalex.org/W2104862809","https://openalex.org/W2115151682","https://openalex.org/W2127236769","https://openalex.org/W2129910432","https://openalex.org/W2131109459","https://openalex.org/W2148338205","https://openalex.org/W2150084430","https://openalex.org/W2162150545","https://openalex.org/W2162980030","https://openalex.org/W2201326897","https://openalex.org/W2321314842","https://openalex.org/W2354234354","https://openalex.org/W2896046649","https://openalex.org/W2896926252","https://openalex.org/W2936307398","https://openalex.org/W2940793962","https://openalex.org/W2963549154","https://openalex.org/W2964300972","https://openalex.org/W2972568116","https://openalex.org/W3010932251","https://openalex.org/W3081285079","https://openalex.org/W3091919520","https://openalex.org/W3093288951","https://openalex.org/W3098055836","https://openalex.org/W3133558578","https://openalex.org/W3175471354","https://openalex.org/W3184008446","https://openalex.org/W3194339614","https://openalex.org/W3217549876","https://openalex.org/W4220959919","https://openalex.org/W4289655154","https://openalex.org/W4306377148","https://openalex.org/W4308216532"],"related_works":["https://openalex.org/W2371167013","https://openalex.org/W1964096323","https://openalex.org/W2740543340","https://openalex.org/W2119135810","https://openalex.org/W2951416090","https://openalex.org/W2105471374","https://openalex.org/W4302771537","https://openalex.org/W2008960744","https://openalex.org/W2014631828","https://openalex.org/W2142293082"],"abstract_inverted_index":{"For":[0,41],"any":[1,42,57],"given":[2,43],"alphabet":[3],"of":[4,23,56,76,101],"size":[5,26,55,75,100],"q,":[6],"a":[7,88],"Homopolymer":[8],"Free":[9],"code":[10,22,59,82],"(HF":[11],"code)":[12],"refers":[13],"to":[14],"an":[15],"(n,":[16],"M,":[17],"d)":[18],"<inf":[19],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[20],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">q</inf>":[21],"length":[24],"n,":[25],"M":[27],"and":[28,49,64,69,92],"minimum":[29],"Hamming":[30],"distance":[31],"d,":[32],"where":[33],"all":[34],"the":[35,53,73,98],"codewords":[36],"are":[37,84,95],"homopolymer":[38,102],"free":[39,103],"sequences.":[40],"alphabet,":[44],"this":[45],"work":[46],"provides":[47],"upper":[48,68,91],"lower":[50,70,93],"bounds":[51,71,94],"on":[52,72,97],"maximum":[54,74,99],"HF":[58,77,81],"using":[60],"Sphere":[61],"Packing":[62],"bound":[63],"Gilbert-Varshamov":[65],"bound.":[66],"Further,":[67],"codes":[78],"for":[79],"various":[80],"families":[83],"calculated.":[85],"Also,":[86],"as":[87],"specific":[89],"case,":[90],"obtained":[96],"DNA":[104],"codes.":[105]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}