{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T19:06:19Z","timestamp":1767985579586,"version":"3.49.0"},"reference-count":35,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T00:00:00Z","timestamp":1767916800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Singapore Ministry of Education Academic Research Fund Tier 2","award":["T2EP50221-0036"],"award-info":[{"award-number":["T2EP50221-0036"]}]},{"name":"SUTD Kickstarter Initiative","award":["2021_04_05"],"award-info":[{"award-number":["2021_04_05"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The design of low-complexity and efficient constrained codes has been a major research item for many years. This paper reports on a versatile method named concatenated constrained codes for designing efficient fixed-length constrained codes with small complexity. A concatenated constrained code comprises two (or more) cooperating constrained codes of low complexity enabling long constrained codes that are not practically feasible with prior art methods. We apply the concatenated coding approach to two case studies, namely the design of constant-weight and low-weight codes. In a binary constant-weight code, each codeword has the same number, w, of 1\u2019s, where w is called the weight of a codeword. We specifically focus on the trading between coder complexity and redundancy.<\/jats:p>","DOI":"10.3390\/e28010078","type":"journal-article","created":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T14:15:50Z","timestamp":1767968150000},"page":"78","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Concatenated Constrained Coding: A New Approach to Efficient Constant-Weight Codes"],"prefix":"10.3390","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6747-9261","authenticated-orcid":false,"given":"Kees Schouhamer","family":"Immink","sequence":"first","affiliation":[{"name":"Turing Machines Inc., Willemskade 15, 3016 DK Rotterdam, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8333-1301","authenticated-orcid":false,"given":"Jos H.","family":"Weber","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, Delft University of Technology, 2628 CD Delft, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3179-9471","authenticated-orcid":false,"given":"Tuan Thanh","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Science, Mathematics and Technology Cluster, Singapore University of Technology and Design (SUTD), 8 Somapah Rd, Singapore 487372, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2059-0071","authenticated-orcid":false,"given":"Kui","family":"Cai","sequence":"additional","affiliation":[{"name":"Science, Mathematics and Technology Cluster, Singapore University of Technology and Design (SUTD), 8 Somapah Rd, Singapore 487372, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2026,1,9]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A Mathematical Theory of Communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell Syst. Tech. J."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/MCOM.002.2200249","article-title":"Innovation in Constrained Codes","volume":"60","author":"Immink","year":"2022","journal-title":"IEEE Commun. Mag."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/49.124467","article-title":"Finite-state Modulation Codes for Data Storage","volume":"10","author":"Marcus","year":"1992","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"3510","DOI":"10.1109\/TIT.2025.3552660","article-title":"A General Method for the Development of Constrained Codes","volume":"71","author":"Ryabko","year":"2025","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1109\/49.920168","article-title":"Art of Constructing Low-complexity Encoders\/decoders for Constrained Block Codes","volume":"19","author":"Modha","year":"2001","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1109\/18.971739","article-title":"Links Between Complexity Theory and Constrained Block Coding","volume":"48","author":"Stockmeyer","year":"2002","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1109\/26.58748","article-title":"A Coding Scheme for m-out-of-n Codes","volume":"38","author":"Ramabadran","year":"1990","journal-title":"IEEE Trans. Commun."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1109\/TIT.2015.2499181","article-title":"Constant Composition Distribution Matching","volume":"62","author":"Schulte","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/TIT.1973.1054929","article-title":"Enumerative Source Coding","volume":"19","author":"Cover","year":"1973","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1109\/TIT.1972.1054832","article-title":"An Algorithm for Source Coding","volume":"18","author":"Schalkwijk","year":"1972","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"3572","DOI":"10.1109\/TIT.2019.2943244","article-title":"LOCO Codes: Lexicographically-Ordered Constrained Codes","volume":"66","author":"Hareedy","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"4497","DOI":"10.1109\/TIT.2011.2145490","article-title":"Constant-Weight and Constant-Charge Binary Run-Length Limited Codes","volume":"57","author":"Kurmaev","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Butler, J.T., and Sasao, T. (2011, January 7\u201310). Fast constant weight codeword to index converter. Proceedings of the 2011 IEEE 54th International Midwest Symposium on Circuits and Systems (MWSCAS), Seoul, Republic of Korea.","DOI":"10.1109\/MWSCAS.2011.6026312"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"2591","DOI":"10.1109\/18.796411","article-title":"Error propagation assessment of enumerative coding schemes","volume":"45","author":"Immink","year":"1999","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_15","unstructured":"Forney, G.D. (1966). Concatenated Codes, MIT Press."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"3621","DOI":"10.1109\/TIT.2017.2690450","article-title":"Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes","volume":"63","author":"Chee","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"4212","DOI":"10.1109\/TIT.2016.2559504","article-title":"Subblock-Constrained Codes for Real-Time Simultaneous Energy and Information Transfer","volume":"62","author":"Tandon","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1109\/18.30982","article-title":"Optical orthogonal codes: Design, analysis and applications","volume":"35","author":"Chung","year":"1989","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1109\/TC.1983.1676175","article-title":"Exhaustive Test Pattern Generation with Constant Weight Vectors","volume":"32","author":"Tang","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1486","DOI":"10.1109\/TCOMM.2021.3136864","article-title":"Code Constructions and Bounds for Identification via Channels","volume":"70","author":"Gunlu","year":"2022","journal-title":"IEEE Trans. Commun."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1109\/12.677239","article-title":"Design of balanced and constant weight codes for VLSI systems","volume":"47","author":"Tallini","year":"1998","journal-title":"IEEE Trans. Comput."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1109\/JSAC.2014.140511","article-title":"Constant Weight Codes: An Approach Based on Knuth\u2019s Balancing Method","volume":"32","author":"Skachek","year":"2014","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_23","unstructured":"Cattermole, K.W. (1969). Principles of Pulse Code Modulation, Iliffe Books Ltd."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"2923","DOI":"10.1109\/TIT.2022.3227467","article-title":"On Hierarchies of Balanced Sequences","volume":"69","author":"Marcovich","year":"2023","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/TIT.1986.1057136","article-title":"Efficient Balanced Codes","volume":"32","author":"Knuth","year":"1986","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1109\/12.795122","article-title":"Balanced codes with parallel encoding and decoding","volume":"48","author":"Tallini","year":"1999","journal-title":"IEEE Trans. Comput."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"4731","DOI":"10.1109\/TIT.2024.3351991","article-title":"Efficient Encoding of Binary Constant-Weight Codes: Variable-Length Balancing Schemes a la Knuth","volume":"70","author":"Dao","year":"2024","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_28","first-page":"30","article-title":"Good Lower and Upper Bounds on Binomial Coefficients","volume":"2","author":"Stanica","year":"2001","journal-title":"J. Inequalities Pure Appl. Math."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1109\/TIT.2008.2011441","article-title":"A Coding Algorithm for Constant Weight Vectors: A Geometric Approach Based on Dissections","volume":"55","author":"Tian","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_30","unstructured":"Weber, J.H., Immink, K.A.S., Siegel, P.H., and Swart, T.G. (2013). Perspectives on Balanced Sequences. arXiv."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"2671","DOI":"10.1109\/18.887880","article-title":"Permutation (d, k) codes: Efficient enumerative coding and phrase length distribution shaping","volume":"46","author":"Milenkovic","year":"2000","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1109\/TC.2006.124","article-title":"Efficient m-ary Balanced Codes which Are Invariant under Symbol Permutation","volume":"55","author":"Mascella","year":"2006","journal-title":"IEEE Trans. Comput."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1109\/TMBMC.2024.3401583","article-title":"Constructions and Properties of Efficient DNA Synthesis Codes","volume":"10","author":"Immink","year":"2024","journal-title":"IEEE Trans. Mol. Biol. Multi-Scale Commun."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"4801","DOI":"10.1109\/TIT.2016.2594798","article-title":"Information-Theoretic Sneak-Path Mitigation in Memristor Crossbar Arrays","volume":"62","author":"Cassuto","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_35","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"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/1\/78\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T14:16:40Z","timestamp":1767968200000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/1\/78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,9]]},"references-count":35,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1]]}},"alternative-id":["e28010078"],"URL":"https:\/\/doi.org\/10.3390\/e28010078","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,9]]}}}