Pollara, Fabrizio and McEliece, Robert J. and Abdel-Ghaffar, Khaled (1988) Finite-state codes. IEEE Transactions on Information Theory, 34 (5). pp. 1083-1089. ISSN 0018-9448 http://resolver.caltech.edu/CaltechAUTHORS:POLieeetit88
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:POLieeetit88
A class of codes called finite-state (FS) codes is defined and investigated. The codes, which generalize both block and convolutional codes, are defined by their encoders, which are finite-state machines with parallel inputs and outputs. A family of upper bounds on the free distance of a given FS code is derived. A general construction for FS codes is given, and it is shown that in many cases the FS codes constructed in this way have a free distance that is the largest possible. Catastrophic error propagation (CEP) for FS codes is also discussed. It is found that to avoid CEP one must solve the graph-theoretic problem of finding a uniquely decodable edge labeling of the state diagram.
|Additional Information:||© Copyright 1988 IEEE. Reprinted with permission. Manuscript received April 9, 1987; revised December 21, 1987. This work was supported in part by the National Aeronautics and Space Administration, and by Grants from IBM and Pacific Bell.|
|Subject Keywords:||boundary-value problems; encoding; errors; graph theory|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||17 Dec 2006|
|Last Modified:||26 Dec 2012 09:23|
Repository Staff Only: item control page