Flavio Salizzoni

University of Neuchâtel | UniNE · Institut de mathématiques (IMA)

Rank-metric codes have been a central topic in coding theory due to their theoretical and practical significance, with applications in network coding, distributed storage, crisscross error correction, and post-quantum cryptography. Recent research has focused on constructing new families of rank-metric codes with distinct algebraic structures, emph...

We revisit the notion of [Formula: see text]th generalized column weights for the [Formula: see text]-truncation of a convolutional code. Taking the limit as [Formula: see text] tends to infinity, we define [Formula: see text]th generalized column weights of a convolutional code. We introduce suitable notions of [Formula: see text]-equivalence and...

In 1997 Rosenthal and York defined generalized Hamming weights for convolutional codes, by regarding a convolutional code as an infinite dimensional linear code endowed with the Hamming metric. In this paper, we propose a new definition of generalized weights of convolutional codes, that takes into account the underlying module structure of the cod...

Which integer sequences are sequences of generalized weights of a linear code? In this paper, we answer this question for linear block codes, rank-metric codes, and more generally for sum-rank metric codes. We do so under an existence assumption for MDS and MSRD codes. We also prove that the same integer sequences appear as sequences of greedy weig...

The MacWilliams' Extension Theorem is a classical result by Florence Jessie MacWilliams. It shows that every linear isometry between linear block-codes endowed with the Hamming distance can be extended to a linear isometry of the ambient space. Such an extension fails to exist in general for rank-metric codes, that is, one can easily find examples...

The solving degree is an important parameter for estimating the complexity of solving a system of polynomial equations. In this paper, we provide an upper bound for the solving degree in terms of the degree of regularity. We also show that this bound is optimal. As a direct consequence, we prove an upper bound for the last fall degree and a Macaula...

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 coding and distributed storage systems. The aim of this chapter is to present the mathematical theory of sum-rank metric codes, paying special attention to the $\mathbb{F}_...

We define a notion of r-generalized column distances for the j-truncation of a convolutional code. Taking the limit as j tends to infinity allows us to define r-generalized column distances of a convolutional code. We establish some properties of these invariants and compare them with other invariants of convolutional codes which appear in the lite...

In 1997 Rosenthal and York defined generalized Hamming weights for convolutional codes, by regarding a convolutional code as an infinite dimensional linear code endowed with the Hamming metric. In this paper, we propose a new definition of generalized weights of convolutional codes, that takes into account the underlying module structure of the cod...

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...

We prove the so-called Addition Theorem for the algebraic entropy of actions of cancellative right amenable monoids S on discrete abelian groups A by endomorphisms, under the hypothesis that S is locally monotileable (that is, S admits a right Følner sequence (Fn)n∈N such that Fn is a monotile of Fn+1 for every n∈N). We study in details the class o...

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...

Additivity with respect to exact sequences is, notoriously, a fundamental property of the algebraic entropy of group endomorphisms. It was proved for abelian groups by using the structure theorems for such groups in an essential way. On the other hand, a solvable counterexample was recently found, showing that it does not hold in general. Neverthel...

The additivity with respect to exact sequences is notoriously a fundamental property of the algebraic entropy of group endomorphisms. It was proved for abelian groups by deeply exploiting their structure. On the other hand, a solvable counterexample was recently found, showing that it does not hold in general. Nevertheless, we give a rather short p...

We prove an instance of the so-called Addition Theorem for the algebraic entropy of actions of cancellative right amenable monoids $S$ on discrete abelian groups $A$ by endomorphisms, under the hypothesis that $S$ is locally monotileable (that is, $S$ admits a right F\o lner sequence $(F_n)_{n\in\mathbb N}$ such that $F_n$ is a monotile of $F_{n+1}...