• DocumentCode
    2985293
  • Title

    Fast enumeration of run-length-limited words

  • Author

    Ryabko, Boris ; Medvedeva, Yulia

  • Author_Institution
    Inst. of Comput. Technol. of Siberian Branch of Russian Acad. of Sci., Siberian State Univ. of Telecommun. & Inf., Novosibirsk, Russia
  • fYear
    2009
  • fDate
    June 28 2009-July 3 2009
  • Firstpage
    640
  • Lastpage
    643
  • 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.
  • Keywords
    decoding; encoding; dklr-sequences; fast enumeration; run-length-limited words; Binary sequences; Decoding; Encoding; Informatics; Length measurement; Polynomials; Random access memory; Size measurement; Telecommunication computing; Time measurement;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2009. ISIT 2009. IEEE International Symposium on
  • Conference_Location
    Seoul
  • Print_ISBN
    978-1-4244-4312-3
  • Electronic_ISBN
    978-1-4244-4313-0
  • Type

    conf

  • DOI
    10.1109/ISIT.2009.5205705
  • Filename
    5205705
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2985293