{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:02:50Z","timestamp":1760144570798,"version":"build-2065373602"},"reference-count":22,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2024,4,19]],"date-time":"2024-04-19T00:00:00Z","timestamp":1713484800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Education, Singapore","award":["MOE-T2EP20121-0007","RG19\/23"],"award-info":[{"award-number":["MOE-T2EP20121-0007","RG19\/23"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>We revisit the well-known Gilbert\u2013Varshamov (GV) bound for constrained systems. In 1991, Kolesnik and Krachkovsky showed that the GV bound can be determined via the solution of an optimization problem. Later, in 1992, Marcus and Roth modified the optimization problem and improved the GV bound in many instances. In this work, we provide explicit numerical procedures to solve these two optimization problems and, hence, compute the bounds. We then show that the procedures can be further simplified when we plot the respective curves. In the case where the graph presentation comprises a single state, we provide explicit formulas for both bounds.<\/jats:p>","DOI":"10.3390\/e26040346","type":"journal-article","created":{"date-parts":[[2024,4,19]],"date-time":"2024-04-19T10:53:17Z","timestamp":1713523997000},"page":"346","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Evaluating the Gilbert\u2013Varshamov Bound for Constrained Systems"],"prefix":"10.3390","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3027-9789","authenticated-orcid":false,"given":"Keshav","family":"Goyal","sequence":"first","affiliation":[{"name":"School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore 637121, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5611-0848","authenticated-orcid":false,"given":"Han Mao","family":"Kiah","sequence":"additional","affiliation":[{"name":"School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore 637121, Singapore"}]}],"member":"1968","published-online":{"date-parts":[[2024,4,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1109\/TMBMC.2016.2537305","article-title":"DNA-Based Storage: Trends and Methods","volume":"1","author":"Yazdi","year":"2015","journal-title":"IEEE Trans. Mol. Biol. Multi-Scale Commun."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1676","DOI":"10.1109\/LCOMM.2019.2930970","article-title":"Efficient balanced and maximum homopolymer-run restricted block codes for DNA-based data storage","volume":"23","author":"Immink","year":"2019","journal-title":"IEEE Commun. Lett."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"5602","DOI":"10.1109\/TIT.2021.3066430","article-title":"Capacity-Approaching Constrained Codes with Error Correction for DNA-Based Data Storage","volume":"67","author":"Nguyen","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1638","DOI":"10.1109\/TIT.2021.3134871","article-title":"Asymptotic Behavior and Typicality Properties of Runlength-Limited Sequences","volume":"68","year":"2022","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"2086","DOI":"10.1109\/TCOMM.2013.031213.120723","article-title":"Interactive joint transfer of energy and information","volume":"61","author":"Popovski","year":"2013","journal-title":"IEEE Trans. Commun."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2121","DOI":"10.1109\/TCOMM.2014.2317480","article-title":"Constrained codes for joint energy and information transfer","volume":"62","author":"Fouladgar","year":"2014","journal-title":"IEEE Trans. Commun."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"4212","DOI":"10.1109\/TIT.2016.2559504","article-title":"Subblock-constrained codes for real-time simultaneously energy and information transfer","volume":"62","author":"Tandon","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2383","DOI":"10.1109\/LCOMM.2020.3012301","article-title":"Block Codes for Energy-Harvesting Sliding- Window Constrained Channels","volume":"24","author":"Immink","year":"2020","journal-title":"IEEE Commun. Lett."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1890","DOI":"10.1109\/LCOMM.2020.2993467","article-title":"Properties and Constructions of Energy-Harvesting Sliding-Window Constrained Codes","volume":"24","author":"Immink","year":"2020","journal-title":"IEEE Commun. Lett."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"2824","DOI":"10.1109\/TCOMM.2021.3058965","article-title":"Skip-sliding window codes","volume":"69","author":"Wu","year":"2021","journal-title":"IEEE Trans. Commun."},{"key":"ref_11","unstructured":"Marcus, B.H., Roth, R.M., and Siegel, P.H. (2020, October 01). Available online: https:\/\/ronny.cswp.cs.technion.ac.il\/wp-content\/uploads\/sites\/54\/2016\/05\/chapters1-9.pdf."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1109\/18.79947","article-title":"Generating functions and lower bounds on rates for limiting error-correcting codes","volume":"37","author":"Kolesnik","year":"1991","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1109\/18.256522","article-title":"A generalized Gilbert-Varshamov bound derived via analysis of a code-search algorithm","volume":"39","author":"Gu","year":"1993","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1109\/18.144702","article-title":"Improved Gilbert-Varshamov bound for constrained systems","volume":"38","author":"Marcus","year":"1992","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/ett.4460070309","article-title":"Upper bounds on the size of error-correcting runlength-limited codes","volume":"37","author":"Winick","year":"1996","journal-title":"Eur. Trans. Telecommun."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Goyal, K., and Kiah, H.M. (July, January 26). Evaluating the Gilbert-Varshamov Bound for Constrained Systems. Proceedings of the 2022 IEEE International Symposium on Information Theory (ISIT), Espoo, Finland.","DOI":"10.3390\/e26040346"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1605","DOI":"10.1109\/18.623158","article-title":"The generalized Gilbert-Varshamov bound is implied by Turan\u2019s theorem","volume":"43","author":"Tolhuizen","year":"1997","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","unstructured":"Luenberger, D.G. (1973). Introduction to Linear and Nonlinear Programming, Addison-Wesley."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Rockafellar, T. (1970). Convex Analysis, Princeton University.","DOI":"10.1515\/9781400873173"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Kashyap, N., Roth, R.M., and Siegel, P.H. (2019, January 7\u201312). The Capacity of Count-Constrained ICI-Free Systems. Proceedings of the 2019 IEEE International Symposium on Information Theory (ISIT), Paris, France.","DOI":"10.1109\/ISIT.2019.8849473"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"6604","DOI":"10.1109\/TIT.2018.2864137","article-title":"Bounds on the size and asymptotic rate of subblock-constrained codes","volume":"64","author":"Tandon","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_22","unstructured":"Stewart, G.W. (1973). Introduction to Matrix Computations, Academic Press. Computer Science and Applied Mathematics."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/4\/346\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:31:16Z","timestamp":1760106676000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/4\/346"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,19]]},"references-count":22,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,4]]}},"alternative-id":["e26040346"],"URL":"https:\/\/doi.org\/10.3390\/e26040346","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2024,4,19]]}}}