A Caltech Library Service

The Viterbi decoding complexity of linear block codes

McEliece, Robert J. (1994) The Viterbi decoding complexity of linear block codes. In: Proceedings 1994 IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ, p. 341. ISBN 0-7803-2015-8.

PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


A given linear block code can be represented by many different trellises. In this paper, we will show that if these trellises are scored according to the complexity of implementing the Viterbi decoding algorithm on them, there is a uniquely optimal one, viz. The “Wolf (1978)-Massey (1978)-Muder (1988)” trellis. We will also introduce “minimal-span” generator matrices, which permit easy construction of WMM trellises.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 1994 IEEE. Date of Current Version: 06 August 2002. This work was partially supported by AFOSR grant no. F49620-94-1-005, and by a grant from Pacific Bell. A portion of the work was also done at the Jet Propulsion Laboratory, California Institute of Technology, under contract to the National Aeronautics and Space Administration.
Funding AgencyGrant Number
Air Force Office of Scientific Research (AFOSR)F49620-94-1-005
Record Number:CaltechAUTHORS:20120221-092955129
Persistent URL:
Official Citation:McEliece, R.J.; , "The Viterbi decoding complexity of linear block codes," Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on , vol., no., pp.341, 27 Jun-1 Jul 1994 doi: 10.1109/ISIT.1994.394677 URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:29384
Deposited By: Tony Diaz
Deposited On:21 Feb 2012 22:11
Last Modified:03 Oct 2019 03:40

Repository Staff Only: item control page