• DocumentCode
    1304332
  • Title

    A lower bound on average codeword length of variable length error-correcting codes

  • Author

    Bernard, Margaret Ann ; Sharma, Bhu Dev

  • Author_Institution
    Dept. of Math., Univ. of West Indies, St. Augustine, Trinidad and Tobago
  • Volume
    36
  • Issue
    6
  • fYear
    1990
  • fDate
    11/1/1990 12:00:00 AM
  • Firstpage
    1474
  • Lastpage
    1475
  • Abstract
    Codes of variable length that are capable of error correction are studied. A lower bound on the average length of such codes under the criterion of promptness is obtained. This generalizes the celebrated result due to C.E. Shannon (1948) for the noiseless case. The bound obtained provides a measure of optimality for variable-length, error-correcting codes
  • Keywords
    error correction codes; average codeword length; error-correcting codes; lower bound; optimality; promptness; variable length codes; Cryptography; Entropy; Error correction codes; Information theory; Lifting equipment; Polynomials; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.59950
  • Filename
    59950
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1304332