.png){kind=icon}
.png){kind=icon}
Return
Design techniques for weakly constrained codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2003.811377.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A general method of constructing run-length limited (d, k) constrained codes from arbitrary sequences is introduced. This method is then combined with the method of guided scrambling for constructing a class of weakly constrained codes. The proposed codes are analyzed for the case of d = 0 and are shown to give results which are better or comparable to those of the best available codes, however, at the cost of failure with some very low probability. For d > 0, the code efficiency of the codes constructed, according to the proposed method reduces significantly.
Keywords:
bit stuffing
guided scrambling
run-length limited (RLL) code
weakly constrained codes
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
No organization information available