Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#235758] of Robert Calderbank

Papers Published

  1. Calderbank, AB; Forney, GD; Vardy, A, Minimal tail-biting trellises: The Golay code and more, IEEE International Symposium on Information Theory - Proceedings (December, 1998), pp. 255, ISSN 2157-8095 [doi]
    (last updated on 2017/12/14)

    A 16-state tail-biting trellis for the binary (24,12,8) Golay code C 24 is exhibited. This tail-biting trellis is minimal. It has many other nice properties, and may be simpler to decode than the minimal conventional trellis for C 24 . Unwrapping this tail-biting trellis produces a periodically-time-varying 16-state rate-1/2 convolutional code. This «Golay convolutional code» is the first known example of a self-dual doubly-even binary linear convolutional code. It has greater minimum distance than any 16-state time-invariant convolutional code of rate 1/2. Demonstrably minimal tail-biting trellises are given for several other binary and nonbinary self-dual codes. For some nonbinary codes, tail-biting trellises based on code generators over a group are simpler than any tail-biting trellis based on linear generators over a field. © 1998 IEEE.
ph: 919.660.2800
fax: 919.660.2821

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