• DocumentCode
    2337312
  • Title

    Bounds on universal coding: the next generation

  • Author

    Ziv, Jacob

  • Author_Institution
    Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel
  • fYear
    1994
  • fDate
    27-29 Oct 1994
  • Firstpage
    13
  • Abstract
    An important class of universal encoders is the one where the encoder is fed by two inputs: a) The incoming string of data to be compressed. b) An N-bit description of the source statistics (i.e. a “training sequence”). We consider fixed-to-variable universal encoders that noiselessly compress blocks of length l
  • Keywords
    block codes; source coding; statistics; N-bit description; bounds; data compression; fixed-to-variable universal encoders; noiseless compression; source statistics; training sequence; universal coding; Codes; Entropy; Jacobian matrices; Statistics;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory and Statistics, 1994. Proceedings., 1994 IEEE-IMS Workshop on
  • Conference_Location
    Alexandria, VA
  • Print_ISBN
    0-7803-2761-6
  • Type

    conf

  • DOI
    10.1109/WITS.1994.513855
  • Filename
    513855