Upper Bounds on the Minimum Distance of Trellis Codes

Published

Journal Article

A trellis code is a “sliding window” method of encoding a binary data stream into a sequence of real numbers that are input to a noisy transmission channel. When a trellis code is used to encode data at the rate of k bits/channel symbol, each channel input will depend not only on the most recent block of k data bits to enter the encoder but will also depend on, say, the v bits preceding this block. The v bits determine the state of the encoder and the most recent block of k bits generates the channel symbol conditional on the encoder state. The performance of trellis codes, like that of block codes, depends on a suitably defined minimum‚Äźdistance property of the code. In this paper we obtain upper bounds on this minimum distance that are simple functions of k and v. These results also provide a lower bound on the number of states required to achieve a specific coding gain. © 1983 The Bell System Technical Journal

Full Text

Duke Authors

Cited Authors

  • Calderbank, AR; Mazo, JE; Shapiro, HM

Published Date

  • January 1, 1983

Published In

Volume / Issue

  • 62 / 8

Start / End Page

  • 2617 - 2646

Electronic International Standard Serial Number (EISSN)

  • 1538-7305

International Standard Serial Number (ISSN)

  • 0005-8580

Digital Object Identifier (DOI)

  • 10.1002/j.1538-7305.1983.tb03197.x

Citation Source

  • Scopus