In this paper the decoding capabilities of convolutional codes over the erasure channel are
studied. Of special interest will be maximum distance profile (MDP) convolutional codes …

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 …

The main results of this paper are twofold: the first one is a matrix theoretical result. We say
that a matrix is superregular if all of its minors that are not trivially zero are nonzero. Given …

This paper introduces a robust point-to-point transmission scheme: Tetrys, that relies on a
novel on-the-fly erasure coding concept which reduces the delay for recovering lost data at …

The column Hamming distance of a convolutional code determines the error correction
capability when streaming over a class of packet erasure channels. We introduce a metric …

This paper revisits strongly-MDS convolutional codes with maximum distance profile (MDP).
These are (non-binary) convolutional codes that have an optimum sequence of column …

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 …

Maximum distance profile (MDP) convolutional codes have the property that their column
distances are as large as possible. It has been shown that, transmitting over an erasure …

In the last decade there has been a great interest in extending results for codes equipped
with the Hamming metric to analogous results for codes endowed with the rank metric. This …

In this paper two-dimensional convolutional codes with finite support are considered, ie,
convolutional codes whose codewords have compact support indexed in N2 and take …