By Topic

Application of linear graphs to communication problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Laemmel, Arthur E. ; Polytechnic Institute of Brooklyn, New York, N. Y.

Codes have been discussed recently in connection with signal compression and noise reduction in communication theory, and they are here defined as transformations between two time series of discrete symbols. The electronic apparatus which performs the transformation, or any part of the apparatus, can be described by a linear graph which represents transitions between different memory-states. It will be shown how these graphs can be used to systematically classify codes, combine different blocks of apparatus, examine synchronism of decoding apparatus, etc. Linear graphs have been studied as mathematical systems in connection with topology, Markov chains, and electrical network theory; hence there is already much theory which might be profitably applied to communication problems.

Published in:

Information Theory, Transactions of the IRE Professional Group on  (Volume:3 ,  Issue: 3 )