On Skew Convolutional and Trellis Codes

Vladimir Sidorenko, Wenhui Li, Onur Günlü, Gerhard Kramer

Abstract

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.
BibTeX
@misc{sidorenko2021skew,
  author = {Vladimir Sidorenko and Wenhui Li and Onur Günlü and Gerhard Kramer},
  title = {{On Skew Convolutional and Trellis Codes}},
  year = {2021},
  eprint = {2102.01510},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2102.01510},
}

Loading related content...

Figure