Abstract: In this paper we present a concrete algebraic construction of a novel class of convolutional codes. These codes are built upon generalized Vandermonde matrices and therefore can be seen as a natural extension of Reed-Solomon block codes to the context of convolutional codes. For this reason we call them weighted Reed-Solomon (WRS) convolutional codes. We show that under some constraints on the defining parameters these codes are Maximum Distance Profile (MDP), which means that they have the maximal possible growth in their column distance profile. We study the size of the field needed to obtain WRS convolutional codes which are MDP and compare it with the existing general constructions of MDP convolutional codes in the literature, showing that in many cases WRS convolutional codes require significantly smaller fields.
Recommendations
Cites work
- A CLASS OF ONE-DIMENSIONAL MDS CONVOLUTIONAL CODES
- A construction of MDS 2D convolutional codes of rate \(1/n\) based on superregular matrices
- A link between quasi-cyclic codes and convolutional codes
- A new class of superregular matrices and MDP convolutional codes
- An algebraic construction of rate<tex>1/v</tex>-ary codes; algebraic construction (Corresp.)
- Class of constructive asymptotically good algebraic codes
- Complete j-MDP Convolutional Codes
- Constructing strongly-MDS convolutional codes with maximum distance profile
- Constructions of MDS convolutional codes using superregular matrices
- Constructions of MDS-convolutional codes
- Convolutional Codes With Maximum Column Sum Rank for Network Streaming
- Convolutional codes with maximum distance profile
- Decoding of Convolutional Codes Over the Erasure Channel
- scientific article; zbMATH DE number 3711820 (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?)
- scientific article; zbMATH DE number 515913 (Why is no real title available?)
- Layered Constructions for Low-Delay Streaming Codes
- Maximum Distance Separable 2D Convolutional Codes
- Maximum distance separable convolutional codes
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Necessary field size and probability for MDP and complete MDP convolutional codes
- On negacyclic MDS-convolutional codes
- On superregular matrices and MDP convolutional codes
- On the Construction of 1-D MDS Convolutional Goppa Codes
- On the left primeness of some polynomial matrices with applications to convolutional codes
- Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures
- Polynomial weights and code constructions
- Strongly-MDS convolutional codes
- Superregular matrices and applications to convolutional codes
Cited in
(3)
This page was built for publication: Weighted Reed–Solomon convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153488)
