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

Authors:
Yu. S. Medvedeva;B. Ya. Ryabko
Affiliations:
Siberian State University of Telecommunication and Information Science, Novosibirsk, Russia;Siberian Branch of the Russian Academy of Sciences, Siberian State University of Telecommunication and Information Science Institute of Computational Technologies, Novosibirsk, Russia
Venue:
Problems of Information Transmission
Year:
2010

Citing 5
Cited 0

The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Coding of Run-Length-Limited Sequences

Problems of Information Transmission
Enumerative Coding for Constant-Weight Binary Sequences with Constrained Run-Length of Zeros

Problems of Information Transmission
Fast enumeration of run-length-limited words

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
An enumerative method for runlength-limited codes: permutation codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an algorithm for enumeration and denumeration of words with given constraints on run lengths of ones (dklr-sequences). For large n, operation time of the algorithm (per symbol of a sequence) is at most O(log3 n log log n), where n is the length of enumerated words, whereas for the best known methods it is at least cn, c 0.