Construction of high rate run-length limited codes using arithmetic decoding

We suggest an approach to constructing low-redundant RLL (d; k)-codes whose complexity does not depend on the code length and is determined solely by the achievable redundancy r, the time and space complexity being O(log²(1/r)) and O(log(1/r)), respectively, as r → 0. First we select code-words whose combinations may constitute all (d; k)-constrained sequences of any length. Then we use arithmetic decoding to produce these codewords with (or close to) optimal probabilities from an input sequence. The coding algorithms and estimates of performance are provided.