14 papers · 1 filter
Semidefinite and linear programming bounds for sum-rank-metric codes and non-existence results
Aida Abiad, Antonina P. Khramova, Sven C. Polak +1
The sum-rank metric provides a unifying framework that generalizes both the celebrated Hamming and rank metrics, and has found applications in areas such as network coding, distrib…
On the existence of linear rank-metric intersecting codes
Martino Borello, Olga Polverino, Ferdinando Zullo
Intersecting codes are a classical object in coding theory whose rank-metric analogue has recently been introduced. Although the definition formally parallels the Hamming-metric ca…
Rank-metric codes over arbitrary fields: Bounds and constructions
Alessandro Neri, Ferdinando Zullo
Rank-metric codes, defined as sets of matrices over a finite field with the rank distance, have gained significant attention due to their applications in network coding and connect…
Decoding Trombetti-Zhou codes: a new syndrome-based decoding approach
Chunlei Li, Angelica Piccirillo, Olga Polverino +1
In 2019, Trombetti and Zhou introduced a new family of -linear Maximum Rank Distance (MRD) codes over . For such codes we propose a new syndr…
One-weight codes in the sum-rank metric
Usman Mushrraf, Ferdinando Zullo
One-weight codes, in which all nonzero codewords share the same weight, form a highly structured class of linear codes with deep connections to finite geometry. While their classif…
The Geometry of Codes for Random Access in DNA Storage
Anina Gruica, Maria Montanucci, Ferdinando Zullo
Effective and reliable data retrieval is critical for the feasibility of DNA storage, and the development of random access efficiency plays a key role in its practicality and relia…