Abstract
We investigate the notion of cyclicity for convolutional codes as it has been introduced by Piret and Roos. Codes of this type are described as submodules of F[z]n with some additional generalized cyclic structure but also as specific left ideals in a skew polynomial ring. Extending a result of Piret, we show in a purely algebraic setting that these ideals are always principal. This leads to the notion of a generator polynomial just like for cyclic block codes. Similarly a parity check polynomial can be introduced by considering the right annihilator ideal. An algorithmic procedure is developed which produces unique reduced generator and parity check polynomials. We also show how basic code properties and a minimal generator matrix can be read off from these objects. A close link between polynomial and vector description of the codes is provided by certain generalized circulant matrices.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Betten, A. et al.: Codierungstheorie: Konstruktion und Anwendung linearer Codes, Springer, Berlin, 1998.
Cohn, P. M.: Algebra, Vol. 2, Wiley, London, 1977.
Davis, P. J.: Circulant Matrices, Wiley-Interscience, New York, 1979.
Forney, G. D., Jr.: Convolutional codes I: Algebraic structure, IEEE Trans. Inform. Theory 16 (1970), 720–738. (See also corrections in IEEE Trans. Inform. Theory 17 (1971), 360.)
Forney, G. D., Jr.: Minimal bases of rational vector spaces, with applications to multivariable linear systems, SIAM J. Control 13 (1975), 493–520.
Gantmacher, F. R.: The Theory of Matrices, Vol. 1, Chelsea, New York, 1977.
Gluesing-Luerssen, H. and Langfeld, B.: On the parameters of convolutional codes with cyclic structure, Preprint, 2003. Submitted. Available at http://front.math. ucdavis.edu/ with ID-number RA/0312092.
Gluesing-Luerssen, H. and Schmale, W.: Distance bounds for convolutional codes and some optimal codes, Preprint, 2003. Submitted. Available at http://front.math. ucdavis.edu/ with IDnumber RA/0305135.
Gluesing-Luerssen, H., Schmale, W. and Striha, M.: Some small cyclic convolutional codes, In: Electronic Proceedings of the 15th International Symposium on the Mathematical Theory of Networks and Systems, Notre Dame, IN (U.S.A.), 2002 (8 pages).
Hole, K. J.: On classes of convolutional codes that are not asymptotically catastrophic, IEEE Trans. Inform. Theory 46 (2000), 663–669.
Jacobson, N.: Basic Algebra I, 2nd edn, W. H. Freeman, New York, 1985.
Johannesson, R. and Zigangirov, K. S.: Fundamentals of Convolutional Coding, IEEE Press, New York, 1999.
Justesen, J.: Bounded distance decoding of unit memory codes, IEEE Trans. Inform. Theory IT-39 (1993), 1616–1627.
Kaenel, P. A. von: Generators of principal left ideals in a noncommutative algebra, Rocky Mountain J. Math. 11 (1981), 27–30.
MacWilliams, F. J. and Sloane, N. J. A.: The Theory of Error-Correcting Codes, North-Holland, 1977.
Massey, J. L. and Sain, M. K.: Codes, automata, and continuous systems: Explicit interconnections, IEEE Trans. Automat. Control AC-12 (1967), 644–650.
Massey, J. L. and Sain, M. K.: Inverses of linear sequential circuits, IEEE Trans. Comput. C-17 (1968), 330–337.
McEliece, R. J.: The algebraic theory of convolutional codes, In: V. Pless and W. Huffman (eds), Handbook of Coding Theory, Vol. 1, Elsevier, Amsterdam, 1998, pp. 1065–1138.
Piret, P.: Structure and constructions of cyclic convolutional codes, IEEE Trans. Inform. Theory 22 (1976), 147–155.
Piret, P.: Convolutional Codes; An Algebraic Approach, MIT Press, Cambridge, MA, 1988.
Piret, P.: A convolutional equivalent to Reed-Solomon codes, Philips J. Res. 43 (1988), 441–458.
Roos, C.: On the structure of convolutional and cyclic convolutional codes, IEEE Trans. Inform. Theory 25 (1979), 676–683.
Rosenthal, J.: Connections between linear systems and convolutional codes, In: B. Marcus and J. Rosenthal (eds), Codes, Systems, and Graphical Models, Springer, Berlin, 2001, pp. 39–66.
Rosenthal, J., Schumacher, J. M. and York, E. V.: On behaviors and convolutional codes, IEEE Trans. Inform. Theory 42 (1996), 1881–1891.
Rosenthal, J. and Smarandache, R.: Maximum distance separable convolutional codes, Appl. Algebra Engrg. Comm. Comput. 10 (1999), 15–32.
Rosenthal, J. and York, E. V.: BCH convolutional codes, IEEE Trans. Inform. Theory IT-45 (1999), 1833–1844.
Smarandache, R., Gluesing-Luerssen, H. and Rosenthal, J.: Constructions of MDSconvolutional codes, IEEE Trans. Inform. Theory 47(5) (2001), 2045–2049.
Ventou, M.: Automorphisms and isometries of some modular algebras, In: Algebraic Algorithms and Error-Correcting Codes; Proc. 3rd International Conf. AAECC-3, Lecture Notes in Comput. Sci. 229, Springer, 1985, pp. 202–210.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gluesing-Luerssen, H., Schmale, W. On Cyclic Convolutional Codes. Acta Applicandae Mathematicae 82, 183–237 (2004). https://doi.org/10.1023/B:ACAP.0000027534.61242.09
Issue Date:
DOI: https://doi.org/10.1023/B:ACAP.0000027534.61242.09