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

Based on the Reed-Muller (RM) transform, this paper proposes a Reed-Solomon (RS)
encoding/erasure decoding algorithm for any number of parities. Specifically, we first …

We consider the problem of deriving upper bounds on the parameters of sum-rank-metric
codes, with focus on their dimension and block length. The sum-rank metric is a combination …

Sum-rank metric codes have recently attracted the attention of many researchers, due to
their relevance in several applications. Mathematically, the sum-rank metric is a natural …

We construct $ s $-interleaved linearized Reed--Solomon (ILRS) codes and variants and
propose efficient decoding schemes that can correct errors beyond the unique decoding …

Codes in the sum-rank metric have various applications in error control for multishot network
coding, distributed storage and code-based cryptography. Linearized Reed-Solomon (LRS) …

Recently, codes in the sum-rank metric attracted attention due to several applications in eg
multishot network coding, distributed storage and quantum-resistant cryptography. The sum …

A linear programming bound for sum-rank metric codes Page 1 IEEE TRANSACTIONS ON
INFORMATION THEORY, VOL. X, NO. Y, MONTH YYYY 1 A linear programming bound for …

The sum-rank metric generalizes the Hamming and rank metric by partitioning vectors into
blocks and defining the total weight as the sum of the rank weights of these blocks, based on …

Sum-rank metric codes are a natural extension of both linear block codes and rank-metric
codes. They have several applications in information theory, including multishot network …