Advertisement

Noiseless Channels

  • L. P. Hyvärinen
Part of the Lecture Notes in Operations Research and Mathematical Economics book series (LNE, volume 5)

Abstract

A discrete information system, such as a written natural language, utilizes a finite number n of different symbols (letters, characters) S1, S2, S3, …, Sn. We shall call the ensemble Sj, j = 1, 2, …, n the character set. The words “character” and “symbol” are used interchangeably.

Keywords

Channel Capacity Information Rate Information Capacity Minimum Capacity Variable Length Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin · Heidelberg 1968

Authors and Affiliations

  • L. P. Hyvärinen
    • 1
  1. 1.IBM European Systems Research InstituteGenevaSwitzerland

Personalised recommendations