Fast enumeration of run-length-limited words


An algorithm for enumeration and denumeration of run-length-limited words (dklr-sequences) is proposed. The complexity of the algorithm does not exceed O(log<sup>3</sup> n log log n), where n is the length of word, whereas known methods have the complexity that is not less than c n, c &#x226B; 0. 
DOI: 10.1109/ISIT.2009.5205705


3 Figures and Tables

Cite this paper

@article{Ryabko2009FastEO, title={Fast enumeration of run-length-limited words}, author={Boris Ryabko and Yulia S. Medvedeva}, journal={2009 IEEE International Symposium on Information Theory}, year={2009}, pages={640-643} }