On Skew Convolutional and Trellis Codes

02/02/2021

∙

by   Vladimir Sidorenko, et al.

∙

0

∙

share

Two new classes of skew codes over a finite field are proposed, called skew convolutional codes and skew trellis codes. These two classes are defined by, respectively, left or right sub-modules over the skew fields of fractions of skew polynomials over . The skew convolutional codes can be represented as periodic time-varying ordinary convolutional codes. The skew trellis codes are in general nonlinear over . Every code from both classes has a code trellis and can be decoded by Viterbi or BCJR algorithms.