scientific article; zbMATH DE number 3985113

From MaRDI portal
Publication:3748957





[For the entire collection see Zbl 0597.00006.] In this note we consider a special class of (n,k) convolutional codes, namely those defined by encoders of the following type. Take the k input sequences \(I_ 0(D),...,I_{k-1}(D)\) \((I_ j(D)=\sum^{\infty}_{i=0}a_{ji}\cdot D^ i\) where \(a_{ji}\in GF(q)\) and D being an indeterminate) and form \[ (1)\quad I(D):=\sum^{k-1}_{j=0}D^ j\cdot I_ j(D^ n). \] The encoder output is defined as \[ (2)\quad T(d):=I(D)\cdot G(D) \] where G(D)\(\in GF(q)[D]\) is a polynomial describing the encoder. Following \textit{J. L. Massey} and \textit{M. K. Sain} [IEEE Trans. Comput. C-17, 330-337 (1968; Zbl 0169.015)], we call an (n,k)-convolutional encoder defined by G(D) catastrophic if a nonpolynomial information sequence I(D) of the form (1) results in a polynomial output sequence \(T(D)=I(D)\cdot G(D).\) The aim of our paper is to give a necessary and sufficient condition for a polynomial G(D) over GF(q) to define a non-catastrophic (n,k)- convolutional encoder.











This page was built for publication:

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