.png){kind=icon}
.png){kind=icon}
Return
Concatenated Constrained Coding: A New Approach to Efficient Constant-Weight Codes
.png){kind=icon}
PRE
AI
DOI：10.3390/e28010078.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
balanced code
concatenated constrained code
constant-weight code
constrained code
Knuth's algorithm
low-weight code
m-out-of-n code
Journal
IF:
2
Papers:
919
Citations:
2.4W