Convolutional codes with a maximum distance profile based on skew polynomials
Information Theory
2021-12-09 v1 Computational Complexity
math.IT
Rings and Algebras
Abstract
We construct a family of (n,k) convolutional codes with degree \delta in {k,n-k} that have a maximum distance profile. The field size required for our construction is of the order n^{2\delta}, which improves upon the known constructions of convolutional codes with a maximum distance profile. Our construction is based on the theory of skew polynomials.
Cite
@article{arxiv.2112.04118,
title = {Convolutional codes with a maximum distance profile based on skew polynomials},
author = {Zitan Chen},
journal= {arXiv preprint arXiv:2112.04118},
year = {2021}
}