On the existence of non-catastrophic p-encoders of (2,1) convolutional codes over ℤp2
- 14 October 2023
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
- Vol. 23 (07)
Abstract
In this work, we analyze the problem of catastrophicity of encoders of convolutional codes over the Laurent series with coefficients in [ ], [ ]. Kuijper and Pinto proved in [M. Kuijper and R. Pinto, On minimality of convolutional ring encoders, IEEE Trans. Autom. Control 55(11) (2009) 4890–4897] that, contrary to what happens for codes over [ ], where [ ] is a field, when dealing with [ ] there are convolutional codes that do not admit non-catastrophic encoders. Nevertheless it was conjectured that any catastrophic convolutional code admits another type of non-catastrophic encoder called [ ]-encoder. In this paper we solve this conjecture for a class of [ ] convolutional codes over [ ] and show that, in fact, these codes always admit a non-catastrophic p-encoder. We also describe a constructive procedure that allows us to obtain a non-catastrophic [ ]-encoder.Keywords
Funding Information
- Portuguese Foundation for Science and Technology (UIDB/04106/2020)
- Portuguese Foundation for Science and Technology (UIDP/04106/2020)
- Spanish I+D+i (PID2022-142159OB-I00, AICO 2023 with reference CIAICO/2022/167)
This publication has 15 references indexed in Scilit:
- On duals and parity-checks of convolutional codes overFinite Fields and Their Applications, 2019
- On MDS convolutional codes over ${\mathbb {Z}}_{p^{r}}$ Z p rDesigns, Codes and Cryptography, 2016
- A characterization of von Neumann rings in terms of linear systemsLinear Algebra and its Applications, 2016
- MDS and self-dual codes over ringsFinite Fields and Their Applications, 2012
- Convolutional Goppa codes defined on fibrationsApplicable Algebra in Engineering, Communication and Computing, 2012
- Minimal Trellis Construction for Finite Support Convolutional Ring Codes2008
- The predictable degree property and row reducedness for systems over a finite ringLinear Algebra and its Applications, 2007
- Maximum Distance Separable Convolutional CodesApplicable Algebra in Engineering, Communication and Computing, 1999
- An efficient algorithm for constructing minimal trellises for codes over finite abelian groupsIEEE Transactions on Information Theory, 1996
- Modular andp-adic cyclic codesDesigns, Codes and Cryptography, 1995