On Skew Convolutional and Trellis Codes

02/02/2021
by   Vladimir Sidorenko, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/20/2021

Additive Polycyclic Codes over 𝔽_4 Induced by Binary Vectors and Some Optimal Codes

In this paper we study the structure and properties of additive right an...
04/24/2019

Group codes over fields are asymptotically good

Group codes are right or left ideals in a group algebra of a finite grou...
05/20/2020

Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric

We speed up existing decoding algorithms for three code classes in diffe...
03/07/2021

LCD Codes from tridiagonal Toeplitz matrice

Double Toeplitz (DT) codes are codes with a generator matrix of the form...
05/17/2021

Construction and enumeration of left dihedral codes satisfying certain duality properties

Let 𝔽_q be the finite field of q elements and let D_2n=⟨ x,y| x^n=1, y^2...
07/06/2018

Design of Low-Complexity Convolutional Codes over GF(q)

This paper proposes a new family of recursive systematic convolutional c...
11/16/2020

An End-to-end Method for Producing Scanning-robust Stylized QR Codes

Quick Response (QR) code is one of the most worldwide used two-dimension...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.