Abstract
The subject of tail-biting trellis representation of block codes has attracted a lot of interest. One of the major open problems in this area is how to construct a minimal tail-biting trellis for a given linear code. We present a solution to this problem. Given a linear block code C, we show how to construct a linear tail-biting trellis for C that minimizes the product of vertex-space sizes among all possible linear tail-biting trellises for C. Our methods are based on the new concept of the characteristic matrix for a linear block code. The complexity of the resulting construction is O(n/sup 2/) for a code of length n.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
