Convolutional codes with a maximum distance profile based on skew polynomials
Abstract
We construct a family of (n,k) convolutional codes with degree δ in k,n-k that have a maximum distance profile. The field size required for our construction is of the order n2δ, which improves upon the known constructions of convolutional codes with a maximum distance profile. Our construction is based on the theory of skew polynomials.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.