Abstract
It is well known that convolutional codes can be considered as codes over a field of rational functions. Being a code, every convolutional code has block distance df. The free distance df of a convolutional code is lower bounded by d,B, df ges dB. With this approach, every method of designing or combining codes immediately gives a method to design or to combine convolutional codes. The distance dB of the new convolutional code is known (or can be estimated), this gives a lower bound for the free distance of the new convolutional code. We investigate the properties of distance and show that distance of blocked convolutional codes reaches free distance. The proposed method is demonstrated for Reed-Solomon codes, for the direct product codes and for bipartite graph codes. For these examples, bounds of type df ges dB and improved bounds are obtained.
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.
