On Skew Convolutional and Trellis Codes

2 Feb 2021 · Vladimir Sidorenko, Wenhui Li, Onur Günlü, Gerhard Kramer ·

Two new classes of skew codes over a finite field $\F$ 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 $\F$. The skew convolutional codes can be represented as periodic time-varying ordinary convolutional codes. The skew trellis codes are in general nonlinear over $\F$. Every code from both classes has a code trellis and can be decoded by Viterbi or BCJR algorithms.

PDF Abstract

Code

Add Remove Mark official

No code implementations yet. Submit your code now

Datasets

Add Datasets introduced or used in this paper

Edit Social Preview

On Skew Convolutional and Trellis Codes

Code Edit Add Remove Mark official

Categories

Datasets Edit

Code

Add Remove Mark official

Datasets