View in EDS

Concatenated Constrained Coding: A New Approach to Efficient Constant-Weight Codes.

Saved in:
Bibliographic Details
Title: Concatenated Constrained Coding: A New Approach to Efficient Constant-Weight Codes.
Authors: Immink, Kees Schouhamer, Weber, Jos H., Nguyen, Tuan Thanh, Cai, Kui
Source: Entropy; Jan2026, Vol. 28 Issue 1, p78, 17p
Subject Terms: BINARY codes, CODING theory, COMPUTATIONAL complexity
Abstract: 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's, where w is called the weight of a codeword. We specifically focus on the trading between coder complexity and redundancy. [ABSTRACT FROM AUTHOR]
Copyright of Entropy is the property of MDPI and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Complementary Index
Description
Abstract: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's, where w is called the weight of a codeword. We specifically focus on the trading between coder complexity and redundancy. [ABSTRACT FROM AUTHOR]
ISSN:10994300
DOI:10.3390/e28010078