On skew convolutional and trellis codes

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

doi:10.1109/ITW46852.2021.9457682

On skew convolutional and trellis codes

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

Chair of Communications Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	2020 IEEE Information Theory Workshop, ITW 2020
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781728159621
DOIs	https://doi.org/10.1109/ITW46852.2021.9457682
State	Published - 11 Apr 2021
Event	2020 IEEE Information Theory Workshop, ITW 2020 - Virtual, Riva del Garda, Italy Duration: 11 Apr 2021 → 15 Apr 2021

Publication series

Name	2020 IEEE Information Theory Workshop, ITW 2020

Conference

Conference	2020 IEEE Information Theory Workshop, ITW 2020
Country/Territory	Italy
City	Virtual, Riva del Garda
Period	11/04/21 → 15/04/21

Access to Document

10.1109/ITW46852.2021.9457682

Cite this

@inproceedings{0feba979df1b4aecb8fe78f0305031a2,

title = "On skew convolutional and trellis codes",

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.",

author = "Vladimir Sidorenko and Wenhui Li and Onur G{\"u}nl{\"u} and Gerhard Kramer",

note = "Publisher Copyright: {\textcopyright}2021 IEEE; 2020 IEEE Information Theory Workshop, ITW 2020 ; Conference date: 11-04-2021 Through 15-04-2021",

year = "2021",

month = apr,

day = "11",

doi = "10.1109/ITW46852.2021.9457682",

language = "English",

series = "2020 IEEE Information Theory Workshop, ITW 2020",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2020 IEEE Information Theory Workshop, ITW 2020",

}

Sidorenko, V, Li, W, Günlü, O & Kramer, G 2021, On skew convolutional and trellis codes. in 2020 IEEE Information Theory Workshop, ITW 2020., 9457682, 2020 IEEE Information Theory Workshop, ITW 2020, Institute of Electrical and Electronics Engineers Inc., 2020 IEEE Information Theory Workshop, ITW 2020, Virtual, Riva del Garda, Italy, 11/04/21. https://doi.org/10.1109/ITW46852.2021.9457682

On skew convolutional and trellis codes. / Sidorenko, Vladimir; Li, Wenhui; Günlü, Onur et al.
2020 IEEE Information Theory Workshop, ITW 2020. Institute of Electrical and Electronics Engineers Inc., 2021. 9457682 (2020 IEEE Information Theory Workshop, ITW 2020).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On skew convolutional and trellis codes

AU - Sidorenko, Vladimir

AU - Li, Wenhui

AU - Günlü, Onur

AU - Kramer, Gerhard

PY - 2021/4/11

Y1 - 2021/4/11

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85113296539&partnerID=8YFLogxK

U2 - 10.1109/ITW46852.2021.9457682

DO - 10.1109/ITW46852.2021.9457682

M3 - Conference contribution

AN - SCOPUS:85113296539

T3 - 2020 IEEE Information Theory Workshop, ITW 2020

BT - 2020 IEEE Information Theory Workshop, ITW 2020

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2020 IEEE Information Theory Workshop, ITW 2020

Y2 - 11 April 2021 through 15 April 2021

ER -

On skew convolutional and trellis codes

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this