Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published September 1988 | Published
Journal Article Open

Finite-state codes

Abstract

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

© 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.

Attached Files

Published - POLieeetit88.pdf

Files

POLieeetit88.pdf
Files (914.2 kB)
Name Size Download all
md5:f881d36d053a5f30ea0b906f2cc8e8f2
914.2 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 16, 2023