Convolutional Codes With a Maximum Distance Profile Based on Skew Polynomials

DOI10.1109/TIT.2022.3163653MaRDI QIDQ5096981zbMATH OpenOpenAlexWikidataFDO

Authors Zitan Chen

Publication date 19 August 2022

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2112.04118

zbMATH Keywords

convolutional codesmaximum distance profile

Mathematics Subject Classification ID

Convolutional codes (94B10)

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^{2delta}, which improves upon the known constructions of convolutional codes with a maximum distance profile. Our construction is based on the theory of skew polynomials.

Cited in

(2)

• Convolutional codes with maximum distance profile
• New constructions of MDP convolutional codes with memory 1 for k=2,3

This page was built for publication: Convolutional Codes With a Maximum Distance Profile Based on Skew Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096981)