Skip to main content

Minimal tail-biting trellises: The Golay code and more

Publication ,  Journal Article
Published in: IEEE International Symposium on Information Theory - Proceedings
December 1, 1998

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.

Duke Scholars

Published In

IEEE International Symposium on Information Theory - Proceedings

DOI

ISSN

2157-8095

Publication Date

December 1, 1998

Start / End Page

255
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Minimal tail-biting trellises: The Golay code and more. (1998). IEEE International Symposium on Information Theory - Proceedings, 255. https://doi.org/10.1109/ISIT.1998.708860
Minimal tail-biting trellises: The Golay code and more.” IEEE International Symposium on Information Theory - Proceedings, December 1, 1998, 255. https://doi.org/10.1109/ISIT.1998.708860.
Minimal tail-biting trellises: The Golay code and more. IEEE International Symposium on Information Theory - Proceedings. 1998 Dec 1;255.
Minimal tail-biting trellises: The Golay code and more.” IEEE International Symposium on Information Theory - Proceedings, Dec. 1998, p. 255. Scopus, doi:10.1109/ISIT.1998.708860.
Minimal tail-biting trellises: The Golay code and more. IEEE International Symposium on Information Theory - Proceedings. 1998 Dec 1;255.

Published In

IEEE International Symposium on Information Theory - Proceedings

DOI

ISSN

2157-8095

Publication Date

December 1, 1998

Start / End Page

255