Minimal tail-biting trellises: The Golay code and more

Published

Journal Article

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

Full Text

Duke Authors

Cited Authors

  • Calderbank, AB; Forney, GD; Vardy, A

Published Date

  • December 1, 1998

Published In

Start / End Page

  • 255 -

International Standard Serial Number (ISSN)

  • 2157-8095

Digital Object Identifier (DOI)

  • 10.1109/ISIT.1998.708860

Citation Source

  • Scopus