A new class of superregular matrices and MDP convolutional codes
From MaRDI portal
Publication:2435474
Abstract: This paper deals with the problem of constructing superregular matrices that lead to MDP convolutional codes. These matrices are a type of lower block triangular Toeplitz matrices with the property that all the square submatrices that can possibly be nonsingular due to the lower block triangular structure are nonsingular. We present a new class of matrices that are superregular over a suficiently large finite field F. Such construction works for any given choice of characteristic of the field F and code parameters (n; k; d) such that (n-k)|d. Finally, we discuss the size of F needed so that the proposed matrices are superregular.
Recommendations
- On superregular matrices and MDP convolutional codes
- Superregular matrices and applications to convolutional codes
- Constructions of MDS convolutional codes using superregular matrices
- A construction of MDS 2D convolutional codes of rate \(1/n\) based on superregular matrices
- From 1D convolutional codes to 2D convolutional codes of rate 1/n
Cites work
- Constructions of MDS-convolutional codes
- Convolutional codes with maximum distance profile
- Convolutional Goppa codes
- scientific article; zbMATH DE number 4010394 (Why is no real title available?)
- scientific article; zbMATH DE number 3458752 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1314690 (Why is no real title available?)
- Maximum distance separable convolutional codes
- On generator matrices of MDS codes (Corresp.)
- On MDS codes via Cauchy matrices
- On superregular matrices and MDP convolutional codes
- Strongly-MDS convolutional codes
- The Existence of Strongly MDS Convolutional Codes
Cited in
(23)- MDS 2D convolutional codes with optimal 1D horizontal projections
- Concatenation of convolutional codes and rank metric codes for multi-shot network coding
- On the existence and construction of maximum distance profile convolutional codes
- Systematic maximum sum rank codes
- A new rank metric for convolutional codes
- Erasure decoding of convolutional codes using first-order representations
- Block Toeplitz matrices for burst-correcting convolutional codes
- Necessary field size and probability for MDP and complete MDP convolutional codes
- Decoding of 2D convolutional codes over an erasure channel
- Superregular matrices and applications to convolutional codes
- Constructing strongly-MDS convolutional codes with maximum distance profile
- From 1D convolutional codes to 2D convolutional codes of rate 1/n
- Burst Erasure Correction of 2D Convolutional Codes
- On optimal extended row distance profile
- On the left primeness of some polynomial matrices with applications to convolutional codes
- On MDS convolutional codes over \(\mathbb{Z}_{p^r}\)
- Complete MDP convolutional codes
- Constructions of MDS convolutional codes using superregular matrices
- Codes in the sum-rank metric: fundamentals and applications
- Weighted Reed–Solomon convolutional codes
- Construction of systematic \((k+1,k)\) memory MDS sliding window codes over embedded fields
- New constructions of MDP convolutional codes with memory 1 for k=2,3
- On superregular matrices and MDP convolutional codes
This page was built for publication: A new class of superregular matrices and MDP convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2435474)
