Codes in the sum-rank metric have attracted significant attention for their applications in
distributed storage systems, multishot network coding, streaming over erasure channels …

Multishot network coding is considered in a worst-case adversarial setting in which an
omniscient adversary with unbounded computational resources may inject erroneous …

In this paper, we design erasure-correcting codes for channels with burst and random
erasures, when a strict decoding delay constraint is in place. We consider the sliding …

In this paper, we investigate streaming codes over a three-node relay network. Source node
transmits a sequence of message packets to the destination via a relay. Source-to-relay and …

In this paper, we study the three-node Decode-and-Forward (D&F) relay network subject to
random and burst packet erasures. The source wishes to transmit an infinite stream of …

Streaming codes are packet-level codes that recover dropped packets within a strict
decoding-delay constraint. We study streaming codes over a sliding-window (SW) channel …

Streaming codes (SCs) are packet-level codes that recover erased packets within a strict
decoding-delay deadline. Streaming codes for various packet erasure channel models such …

This paper introduces the partial-inverse problem for linearized polynomials and develops
its application to decoding Gabidulin codes and lifted Gabidulin codes in linear random …

In this paper, we design erasure-correcting codes for channels with burst and random
erasures, when a strict decoding delay constraint is in place. We consider the sliding …

We study the problem of designing error-correcting codes over channels with burst and
random erasures, when a strict decoding delay constraint τ is in place. Badr et al. introduced …