Minimal Trellis Construction for Finite Support Convolutional Ring Codes

DOI10.1007/978-3-540-87448-5_11zbMATH Open1166.94353arXiv0801.3703OpenAlexW1880607121MaRDI QIDQ3540925FDOQ3540925

Authors: Raquel Pinto, Margreta Kuijper 

Publication date: 25 November 2008

Published in: Coding Theory and Applications (Search for Journal in Brave)

Abstract: Convolutional codes are considered with code sequences modelled as semi-infinite Laurent series. It is wellknown that a convolutional code C over a finite group G has a minimal trellis representation that can be derived from code sequences. It is also wellknown that, for the case that G is a finite field, any polynomial encoder of C can be algebraically manipulated to yield a minimal polynomial encoder whose controller canonical realization is a minimal trellis. In this paper we seek to extend this result to the finite ring case G = Z_{p^r} by introducing a socalled "p-encoder". We show how to manipulate a polynomial encoding of a noncatastrophic convolutional code over Z_{p^r} to produce a particular type of p-encoder ("minimal p-encoder") whose controller canonical realization is a minimal trellis with nonlinear features. The minimum number of trellis states is then expressed as p^gamma, where gamma is the sum of the row degrees of the minimal p-encoder. In particular, we show that any convolutional code over Z_{p^r} admits a delay-free p-encoder which implies the novel result that delay-freeness is not a property of the code but of the encoder, just as in the field case. We conjecture that a similar result holds with respect to catastrophicity, i.e., any catastrophic convolutional code over Z_{p^r} admits a noncatastrophic p-encoder.

Full work available at URL: https://arxiv.org/abs/0801.3703

Recommendations

• State representations of convolutional codes over a finite ring
• Noncatastrophic convolutional codes over a finite ring
• Convolutional codes I: Algebraic structure
• Convolutional codes over groups
• An efficient algorithm for constructing minimal trellises for codes over finite abelian groups

zbMATH Keywords

convolutional codefinite ringpolynomial modulerow reducedminimal trellis\(p\)-generator sequence

Mathematics Subject Classification ID

Convolutional codes (94B10)

Cites Work

• Title not available (Why is that?)
• Maximum distance separable convolutional codes
• Matrix fraction descriptions in convolutional coding
• On behaviors and convolutional codes
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Modular and \(p\)-adic cyclic codes
• Cyclic codes and quadratic residue codes over Z/sub 4/
• Convolutional codes over groups
• The dynamics of group codes: state spaces, trellis diagrams, and canonical encoders
• An efficient algorithm for constructing minimal trellises for codes over finite abelian groups
• Quaternary Convolutional Codes From Linear Block Codes Over Galois Rings
• On Minimality of Convolutional Ring Encoders
• The predictable degree property and row reducedness for systems over a finite ring
• Computation of the weight distribution of CRC codes
• State space realizations and monomial equivalence for convolutional codes
• Minimality and observability of group systems

Cited In (5)

• Minimal Gröbner bases and the predictable leading monomial property
• On the existence of non-catastrophic \(p\)-encoders of \((2, 1)\) convolutional codes over \(\mathbb{Z}_{p^2}\)
• On MDS convolutional codes over \(\mathbb{Z}_{p^r}\)
• Noncatastrophic convolutional codes over a finite ring
• State representations of convolutional codes over a finite ring

This page was built for publication: Minimal Trellis Construction for Finite Support Convolutional Ring Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540925)