Department of Mathematics
 Search | Help | Login

Math @ Duke





.......................

.......................


Publications [#376537] of Robert Calderbank

Papers Published

  1. Calderbank, AR; Mazo, JE; Shapiro, HM, Upper Bounds on the Minimum Distance of Trellis Codes, Bell System Technical Journal, vol. 62 no. 8 (January, 1983), pp. 2617-2646 [doi]
    (last updated on 2026/01/18)

    Abstract:
    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

 

dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320


x