.png){kind=icon}
Return
Efficient Encoding of Constrained Block Codes
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2021.3105327.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present coding methods for generating l-symbol constrained codewords taken from a set, S, of allowed codewords. In standard practice, the size of the set S, denoted by M = vertical bar S vertical bar, is truncated to an integer power of two, which may lead to a serious waste of capacity. We present an efficient and low-complexity coding method for avoiding the truncation loss, where the encoding is accomplished in two steps: first, a series of binary input (user) data is translated into a series of M-ary symbols in the alphabet M = {0,..., M - 1}. Then, in the second step, the M-ary symbols are translated into a series of admissible l-symbol words in S by using a small look-up table. The presented construction of Pearson codes and fixed-weight codes offers a rate close to capacity. For example, a 255B320B balanced code, where 255 source bits are translated into 32 10-bit balanced codewords, has a rate 0.1% below capacity.
Keywords:
Constrained code
code design
binary block code
balanced code
Pearson code
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
Cited Papers
ShareSaveShareSaveShareSave
Characterisation of putative immunomodulatory gene knockouts of lumpy skin disease virus in cattle towards an improved vaccine.png)
Vaccine
VaccineIF0
PREAI
ShareSaveShareSave
View more