• DocumentCode
    1216902
  • Title

    On the asymptotic redundancy of lossless block coding with two codeword lengths

  • Author

    Figueroa, Enrique ; Houdré, Christian

  • Author_Institution
    Dept. of Math., Purdue Univ., West Lafayette, IN, USA
  • Volume
    51
  • Issue
    2
  • fYear
    2005
  • Firstpage
    688
  • Lastpage
    692
  • Abstract
    With the additional constraint of requiring only two codeword lengths, lossless codes of blocks of size n generated by stationary memoryless binary sources are studied. For arbitrary δ>0, classical large-deviation inequalities imply the existence of codes attaining an expected redundancy of the order O(n-12+δ/). It is shown that it is not possible to construct lossless codes with two codeword lengths having rate of order better or equal to O(n-12/).
  • Keywords
    block codes; redundancy; Chernoff-Hoeffding inequalities; Shannon theory; asymptotic redundancy; classical large-deviation inequalities; codeword lengths; lossless block coding; stationary memoryless binary sources; Block codes; Convergence; Decoding; Distribution functions; Entropy; Estimation theory; Mathematics; Random variables;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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