A BCJR-like Labeling Algorithm for Tail-Biting Trellises
- Aditya Nori ,
- Priti Shankar
Proceedings of the IEEE International Symposium on Information Theory (ISIT) |
Published by IEEE Communications Society
WE describe two constructions for tail-biting trellises that are very similar to the well known BCJR construction for conventional trellises. The constructions lead to a simple proof of the fact that there exist linear tail-biting trellises for a linear code and its dual, which have the same state-complexity profiles.
Copyright © 2007 IEEE. Reprinted from IEEE Communications Society. This material is posted here with permission of the IEEE. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.