On Skew Convolutional and Trellis Codes
Information Theory
2021-02-03 v1 math.IT
Abstract
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.
Cite
@article{arxiv.2102.01510,
title = {On Skew Convolutional and Trellis Codes},
author = {Vladimir Sidorenko and Wenhui Li and Onur Günlü and Gerhard Kramer},
journal= {arXiv preprint arXiv:2102.01510},
year = {2021}
}
Comments
To appear in IEEE Information Theory Workshop 2020