Abstract
<abstract><p>Convolutional codes form an important class of codes that have memory. One natural way to study these codes is by means of input state output representations. In this paper we study the minimum (Hamming) weight among codewords produced by input sequences of weight two. In this paper, we consider rate $ 1/n $ and use the linear system setting called $ (A, B, C, D) $ input-state-space representations of convolutional codes for our analysis. Previous results on this area were recently derived assuming that the matrix $ A $, in the input-state-output representation, is nonsingular. This work completes this thread of research by treating the nontrivial case in which $ A $ is singular. Codewords generated by weight-2 inputs are relevant to determine the effective free distance of Turbo codes.</p></abstract>
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.
