• DocumentCode
    916962
  • Title

    A bound for arithmetic codes of composite length (Corresp.)

  • Author

    Hartmann, C.R.P. ; Tzeng, K.K.

  • Volume
    18
  • Issue
    2
  • fYear
    1972
  • fDate
    3/1/1972 12:00:00 AM
  • Firstpage
    308
  • Lastpage
    308
  • Abstract
    This correspondence presents an upper bound on the minimum distance of arithmetic codes of composite length n = n_1 n_2 . The tightness of this bound gives a rather good working estimate of the minimum distance of a prospective code.
  • Keywords
    Arithmetic codes; Block codes; Decoding; Digital arithmetic; Product codes; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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