On skew convolutional and trellis codes

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publication2020 IEEE Information Theory Workshop, ITW 2020
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728159621
StatePublished - 11 Apr 2021
Event2020 IEEE Information Theory Workshop, ITW 2020 - Virtual, Riva del Garda, Italy
Duration: 11 Apr 202115 Apr 2021

Publication series

Name2020 IEEE Information Theory Workshop, ITW 2020


Conference2020 IEEE Information Theory Workshop, ITW 2020
CityVirtual, Riva del Garda


Dive into the research topics of 'On skew convolutional and trellis codes'. Together they form a unique fingerprint.

Cite this