• DocumentCode
    2932649
  • Title

    Fast enumerative source coding

  • Author

    Ryabko, Boris

  • Author_Institution
    Novosibirsk Telecommun. Inst., Russia
  • fYear
    1995
  • fDate
    17-22 Sep 1995
  • Firstpage
    395
  • Abstract
    The problem of enumerative coding was considered by Cover (1973) for the first time. By coding words of a length n the method of Cover has an encoding and decoding speed which equals to O(n) when n→∞. We propose a code which has a high speed: O(log2 nloglogn),n→∞. This code is close to author´s (see IEEE Trans. Inf. Theory, vol.30, no.1, p.98, 1994) previous method
  • Keywords
    decoding; source coding; code length; decoding speed; encoding speed; fast enumerative source coding; high speed code; Algorithm design and analysis; Decoding; Encoding; Source coding;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
  • Conference_Location
    Whistler, BC
  • Print_ISBN
    0-7803-2453-6
  • Type

    conf

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