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 generalization of both the Hamming metric and the rank metric. In this paper, we provide an Anticode Bound for the sum-rank metric, which extends the corresponding Hamming and rank-metric Anticode bounds. We classify then optimal anticodes, i.e., codes attaining the sum-rank metric Anticode Bound. We use these optimal anticodes to define generalized sum-rank weights and we study their main properties. In particular, we prove that the generalized weights of an MSRD code are determined by its parameters. As an application, in the Appendix we explain how generalized weights measure information leakage in multishot network coding.
1 January 2012 in Advances in Mathematics of Communications
In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size $k\times n$ with entries in a finite field $\mathbb F_q$. Spread codes are a family of optimal codes with maximal minimum distance. We give a minimum-distance decoding algorithm which requires $\mathcal{O}((n-k)k^3)$ operations over an extension field $\mathbb F_{q^k}$. Our algorithm is more efficient than the previous ones in the literature, when the dimension $k$ of the codewords is small with respect to $n$. The decoding algorithm takes advantage of the algebraic structure of the code, and it uses original results on minors of a matrix and on the factorization of polynomials over finite fields.
In this paper, we survey the theory of Cartwright–Sturmfels ideals. These are $\mathbb {Z}^{n}$ -graded ideals, whose multigraded generic initial ideal is radical. Cartwright–Sturmfels ideals have surprising properties, mostly stemming from the fact that their Hilbert scheme only contains one Borel-fixed point. This has consequences, e.g., on their universal Gröbner bases and on the family of their initial ideals. In this paper, we discuss several known classes of Cartwright–Sturmfels ideals and we find a new one. Among determinantal ideals of same-size minors of a matrix of variables and Schubert determinantal ideals, we are able to characterize those that are Cartwright–Sturmfels.