Magnetic recordings
Elements of information theory
Elements of information theory
On the construction of maximal prefix-synchronized codes
IEEE Transactions on Information Theory - Part 2
A practical method for approaching the channel capacity of constrained channels
IEEE Transactions on Information Theory
Efficient code constructions for certain two-dimensional constraints
IEEE Transactions on Information Theory
Fixed-Rate Maximum-Runlength-Limited Codes From Variable-Rate Bit Stuffing
IEEE Transactions on Information Theory
A combinatorial technique for constructing high-rate MTR-RLL codes
IEEE Journal on Selected Areas in Communications
Maximum runlength-limited codes with error control capabilities
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.07 |
The sequence replacement technique converts an input sequence into a constrained sequence in which a prescribed subsequence is forbidden to occur. Several coding algorithms are presented that use this technique for the construction of maximum run-length limited sequences. The proposed algorithms show how all forbidden subsequences can be successively or iteratively removed to obtain a constrained sequence and how special subsequences can be inserted at predefined positions in the constrained sequence to represent the indices of the positions where the forbidden subsequences were removed. Several modifications are presented to reduce the impact of transmission errors on the decoding operation, and schemes to provide error control are discussed as well. The proposed algorithms can be implemented efficiently, and the rates of the constructed codes are close to their theoretical maximum. As such, the proposed algorithms are of interest for storage systems and data networks.