Necessary field size and probability for MDP and complete MDP convolutional codes

DOI10.1007/S10623-019-00661-6zbMATH Open1423.94158arXiv1808.03074OpenAlexW2963082222WikidataQ127471951 ScholiaQ127471951MaRDI QIDQ2334449FDOQ2334449

Authors: Julia Lieb 

Publication date: 7 November 2019

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: It has been shown that maximum distance profile (MDP) convolutional codes have optimal recovery rate for windows of a certain length, when transmitting over an erasure channel. In addition, the subclass of complete MDP convolutional codes has the ability to reduce the waiting time during decoding. In this paper, we derive upper bounds on the necessary field size for the existence of MDP and complete MDP convolutional codes and show that these bounds improve the already existing ones. Moreover, we derive lower bounds for the probability that a random code is MDP respective complete MDP.

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

Recommendations

• Complete MDP convolutional codes
• On the existence and construction of maximum distance profile convolutional codes
• Constructing strongly-MDS convolutional codes with maximum distance profile
• MDS convolutional codes
• The Existence of Strongly MDS Convolutional Codes

zbMATH Keywords

convolutional codesfinite fieldssuperregular matricesmaximum distance profile

Mathematics Subject Classification ID

Convolutional codes (94B10)

Cites Work

• Maximum distance separable convolutional codes
• A new class of superregular matrices and MDP convolutional codes
• Convolutional codes with maximum distance profile
• Strongly-MDS convolutional codes
• The Existence of Strongly MDS Convolutional Codes
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Decoding of Convolutional Codes Over the Erasure Channel
• On superregular matrices and MDP convolutional codes
• Superregular matrices and applications to convolutional codes
• Constructing strongly-MDS convolutional codes with maximum distance profile
• Title not available (Why is that?)
• Complete MDP convolutional codes
• The probability of primeness for specially structured polynomial matrices over finite fields with applications to linear systems and convolutional codes
• Title not available (Why is that?)

Cited In (4)

• Weighted Reed–Solomon convolutional codes
• Construction of systematic \((k+1,k)\) memory MDS sliding window codes over embedded fields
• Complete MDP convolutional codes
• On the existence and construction of maximum distance profile convolutional codes

This page was built for publication: Necessary field size and probability for MDP and complete MDP convolutional codes

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