Explicit rate-optimal streaming codes with smaller field size
Streaming codes are a class of packet-level erasure codes that ensure packet recovery over
a sliding window channel which allows either a burst erasure of size or random erasures …
a sliding window channel which allows either a burst erasure of size or random erasures …
[PDF][PDF] Constructing strongly-MDS convolutional codes with maximum distance profile.
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 …
These are (non-binary) convolutional codes that have an optimum sequence of column …
Concatenation of convolutional codes and rank metric codes for multi-shot network coding
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 …
information over a network. In particular we make use of the network several times (multi …
Weighted reed–solomon convolutional codes
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 …
codes. These codes are built upon generalized Vandermonde matrices and therefore can …
Complete MDP convolutional codes
J Lieb - Journal of Algebra and Its Applications, 2019 - World Scientific
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 …
distances are as large as possible. It has been shown that, transmitting over an erasure …
An explicit construction of optimal streaming codes for channels with burst and arbitrary erasures
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 …
recovery of a streaming source over a packet erasure channel. The channel model …
[HTML][HTML] Systematic maximum sum rank codes
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 …
with the Hamming metric to analogous results for codes endowed with the rank metric. This …
Complete j-MDP Convolutional Codes
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 …
for transmission over an erasure channel. In addition, the subclass of complete MDP …
Locally repairable convolutional codes with sliding window repair
Locally repairable convolutional codes (LRCCs) for distributed storage systems (DSSs) are
introduced in this work. They enable local repair, for a single node erasure (or more …
introduced in this work. They enable local repair, for a single node erasure (or more …
Superregular matrices over small finite fields
A trivially zero minor of a matrix is a minor having all its terms in the Leibniz formula equal to
zero. A matrix is superregular if all of its minors that are not trivially zero are nonzero. In the …
zero. A matrix is superregular if all of its minors that are not trivially zero are nonzero. In the …