• DocumentCode
    935085
  • Title

    An easily implementable universal code for the binary source (Corresp.)

  • Author

    Mackenthun, K.

  • Volume
    28
  • Issue
    4
  • fYear
    1982
  • fDate
    7/1/1982 12:00:00 AM
  • Firstpage
    646
  • Lastpage
    648
  • Abstract
    Recently Gallager has given the construction for an optimal source code for geometrically distributed integer alphabets. Gallager´s code can be modified to perform as a universal code for the memoryless binary source; this code construction has several important practical advantages over previous universal codes for the binary source.
  • Keywords
    Source coding; Adaptive filters; Convergence; Least squares methods; Linear regression; Parameter estimation; Signal processing; Signal processing algorithms; Silicon compounds; Stochastic processes; System identification;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1982.1056533
  • Filename
    1056533
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=935085