Abstract
For all linear (n,k,d) MDS codes over finite fields F/sub p/m we identity a generator matrix with the property that the product of trellises of rows of the generator matrix will give a minimal tail-biting linear trellis, and viewing the code as a group code, identify a set of generators, the product of whose trellises will give a minimal tail biting group trellis. We also give the necessary and sufficient condition for the existence of flat minimal linear and group tail-biting trellises.
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.
