Affiliation:
1. Institute Center of Operations Research, Miguel Hernández University, Spain
2. Departament of Mathematics, University of Alicante, Spain
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>
Publisher
American Institute of Mathematical Sciences (AIMS)
Reference34 articles.
1. S. Benedetto, G. Montorsi, Design of parallel concatenated convolutional codes, IEEE T. Commun., 44 (1996), 591–600. https://doi.org/10.1109/26.494303
2. C. Berrou, A. Glavieux, P. Thitimajshima, Near Shannon limit error-correcting coding and decoding: Turbo Codes (1), Proc. of IEEE ICC 93– IEEE International Conference on Communications, 2 (1993), 1064–1070. https://doi.org/10.1109/ICC.1993.397441
3. R. Bru, R. Cantó, B. Ricarte, V. Rumchev, A Basic Canonical Form of Discrete-time Compartmental Systems, Int. J. Contemp. Math. Sciences, 2 (2007), 261–273. http://dx.doi.org/10.12988/ijcms.2007.07020
4. P. Campillo, A. Devesa, V. Herranz, C. Perea, Modelization of turbo encoder from linear system point of view, Proceedings of the 10th International Conference on Computational and Mathematical Methods in Science and Engineering (CMMSE 2010), (2010), 314–317.
5. B. Cantó, C. Coll, E. Sánchez, On positive behaviour of periodic control systems, Appl. Math. Comput., 161 (2005), 779–786. https://doi.org/10.1016/j.amc.2003.03.001