A Caltech Library Service

Finite-state codes

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. doi:10.1109/18.21238.

PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


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.

Item Type:Article
Related URLs:
URLURL TypeDescription
Additional Information:© 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.
Funding AgencyGrant Number
Subject Keywords:boundary-value problems; encoding; errors; graph theory
Issue or Number:5
Record Number:CaltechAUTHORS:POLieeetit88
Persistent URL:
Official Citation:F. Pollara, R. J. McEliece and K. Abdel-Ghaffar, "Finite-state codes," in IEEE Transactions on Information Theory, vol. 34, no. 5, pp. 1083-1089, Sept. 1988. doi: 10.1109/18.21238
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:6667
Deposited By: Archive Administrator
Deposited On:17 Dec 2006
Last Modified:08 Nov 2021 20:35

Repository Staff Only: item control page