• DocumentCode
    928791
  • Title

    Encoding message lengths for data transmission (Corresp.)

  • Author

    Gallager, R.

  • Volume
    24
  • Issue
    4
  • fYear
    1978
  • fDate
    7/1/1978 12:00:00 AM
  • Firstpage
    495
  • Lastpage
    496
  • Abstract
    Two familiar techniques for encoding message lengths are considered. One technique breaks messages into packets, with each but the last message packet having the same length. The message length is encoded by specifying the last packet and its length. The other technique uses a special bit sequence called a flag to terminate the message and slightly re-encodes the message to prevent the flag from appearing within the message. For a geometric message length distribution and for properly chosen parameters, it is shown that the packet strategy is optimal in the Huffman coding sense and that the flag strategy is very close to optimal. Moreover, for a given expected message length the expected codeword lengths are quite insensitive to the message length distribution.
  • Keywords
    Huffman codes; Message switching; Packet switching; Source coding; Store-and-forward networks; Bridges; Data communication; Decoding; Encoding; Helium; Huffman coding; Marine vehicles; Protocols;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1978.1055910
  • Filename
    1055910