Fast enumeration of run-length-limited words

Authors:
Yulia Medvedeva;Boris Ryabko
Affiliations:
Siberian State University of Telecommunications and Informatics, Novosibirsk, Russia;Institute of Computational Technologies of Siberian Branch of Russian Academy of Science and Siberian State University of Telecommunications and Informatics, Novosibirsk, Russia
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 1
Cited 2

The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Fast enumeration algorithm for words with given constraints on run lengths of ones

Problems of Information Transmission
Enumeration of constant-weight run-length limited binary sequences

Problems of Information Transmission

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm for enumeration and denumeration of run-length-limited words (dklr-sequences) is proposed. The complexity of the algorithm does not exceed O(log3 n log log n), where n is the length of word, whereas known methods have the complexity that is not less than cn, c 0.