Abstract

In this paper, by taking multiple-time information in blocks into the coding of linear block codes, a new class of (2 $$k$$ k , $$k$$ k , 2) convolutional codes is constructed, by which a new way of constructing long codes with short ones is obtained. After that, the type of embedded codes is determined and the optimal values of the linear combination coefficients are derived by using a three-dimensional state transfer matrix to analyze and testify the constructing mechanism of the codes. Finally, the simulation experiment tests the error-correcting performance of the (2 $$k$$ k , $$k$$ k , 2) convolutional codes for different value of $$k$$ k , it is shown that the performance of the new convolutional codes compares favorably with that of traditional (2, 1, $$l$$ l ) convolutional codes.

Full Text
Paper version not known

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 call

Disclaimer: 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.