Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

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 …

In this paper we present a novel coding approach to deal with the transmission of
information over a network. In particular we make use of the network several times (multi …

Convolutional codes were introduced by Peter Elias [674] in 1955. They can be seen as a
generalization of block codes. In order to motivate this generalization, consider ak× n …

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 …

This paper presents a new construction of error correcting codes which achieves optimal
recovery of a streaming source over a packet erasure channel. The channel model …

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 …

Maximum distance separable (MDS) convolutional codes are characterized through the
property that the free distance meets the generalized Singleton bound. The existence of free …

Maximum distance profile (MDP) convolutional codes have been proven to be very suitable
for transmission over an erasure channel. In addition, the subclass of complete MDP …