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

DOI10.1007/s10623-019-00661-6zbMath1423.94158arXiv1808.03074OpenAlexW2963082222WikidataQ127471951 ScholiaQ127471951MaRDI QIDQ2334449

Julia Lieb

Publication date: 7 November 2019

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

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

zbMATH Keywords

finite fieldsconvolutional codessuperregular matricesmaximum distance profile

Mathematics Subject Classification ID

Convolutional codes (94B10)

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Superregular matrices and applications to convolutional codes
• Constructing strongly-MDS convolutional codes with maximum distance profile
• On superregular matrices and MDP convolutional codes
• Maximum distance separable convolutional codes
• The probability of primeness for specially structured polynomial matrices over finite fields with applications to linear systems and 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
• Complete MDP convolutional codes

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