State spaces of convolutional codes, codings and encoders

12/05/2017
by   Štěpán Holub, et al.
0

In this paper we give a compact presentation of the theory of abstract spaces for convolutional codes and convolutional encoders, and show a connection between them that seems to be missing in the literature. We use it for a short proof of two facts: the size of a convolutional encoder of a polynomial matrix is at least its inner degree, and the minimal encoder has the size of the external degree if the matrix is reduced.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/14/2021

Smaller Keys for Code-Based Cryptography: McEliece Cryptosystems with Convolutional Encoders

In this paper we present a novel class of convolutional codes and invest...
research
04/14/2021

Noncatastrophic convolutional codes over a finite ring

Noncatastrophic encoders are an important class of polynomial generator ...
research
12/08/2021

Convolutional codes with a maximum distance profile based on skew polynomials

We construct a family of (n,k) convolutional codes with degree δin k,n-k...
research
08/28/2020

Uniquely optimal codes of low complexity are symmetric

We formulate explicit predictions concerning the symmetry of optimal cod...
research
01/20/2020

Systematic Maximum Sum Rank Codes

In the last decade there has been a great interest in extending results ...
research
12/20/2022

Optimizing Serially Concatenated Neural Codes with Classical Decoders

For improving short-length codes, we demonstrate that classic decoders c...
research
01/12/2023

Algebraic Invariants of Codes on Weighted Projective Spaces

Weighted projective spaces are natural generalizations of projective spa...

Please sign up or login with your details

Forgot password? Click here to reset