Abstract:
An algorithm for enumeration and de-numeration of run-length-limited words (dklr-sequences) is proposed. The complexity of the algorithm does not exceed O(log3 n log log ...Show MoreMetadata
Abstract:
An algorithm for enumeration and de-numeration 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 c n, c > 0.
Published in: 2009 IEEE International Symposium on Information Theory
Date of Conference: 28 June 2009 - 03 July 2009
Date Added to IEEE Xplore: 18 August 2009
ISBN Information:
Contents 