Giuseppe Marino

Prof. Giuseppe Marino

Department of Mathematics and Applications “R. Caccioppoli”, University of Naples “Federico II”, Via Cintia, Monte S. Angelo, I-80126 Naples, Italy

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2021 in Combinatorica
Verified
Journal Article
Closed access
PDF file
BCBence Csajbók
Bence Csajbók
Giuseppe MarinoGiuseppe Marino
Giuseppe Marino
OPOlga Polverino
Olga Polverino
FZFerdinando Zullo
Ferdinando Zullo

24 May 2021 in Journal of Combinatorial Designs
Verified
Journal Article
Open access
PDF file
DBDaniele Bartoli
Daniele Bartoli
BCBence Csajbók
Bence Csajbók
Giuseppe MarinoGiuseppe Marino
Giuseppe Marino
RTRocco Trombetti
Rocco Trombetti
Let V denote an r -dimensional vector space over F q n , the finite field of q n elements. Then V is also an r n -dimension vector space over F q . An F q -subspace U of V is ( h , k ) q -evasive if it meets the h -dimensional F q n -subspaces of V in F q -subspaces of dimension at most k . The ( 1 , 1 ) q -evasive subspaces are known as scattered and they have been intensively studied in finite geometry, their maximum size has been proved to be ⌊ r n ∕ 2 ⌋ when r n is even or n = 3 . We investigate the maximum size of ( h , k ) q -evasive subspaces, study two duality relations among them and provide various constructions. In particular, we present the first examples, for infinitely many values of q , of maximum scattered subspaces when r = 3 and n = 5 . We obtain these examples in characteristics 2, 3 and 5.

1 January 2023 in Advances in Mathematics of Communications
Verified
Journal Article
Closed access
PDF file
ACAntonio Cossidente
Antonio Cossidente
IMInformatica Ed Economia Dipartimento di Matematica
Informatica Ed Economia Dipartimento di Matematica
SKSascha Kurz
Sascha Kurz
Giuseppe MarinoGiuseppe Marino
Giuseppe Marino
FPFrancesco Pavese
Francesco Pavese
UCUniversità degli Studi di Napoli Federico Ii Dipartimento di Matematica e Applicazioni Renato Caccioppoli
Università degli Studi di Napoli Federico Ii Dipartimento di Matematica e Applicazioni Renato Caccioppoli
In the context of constant-dimension subspace codes, an important problem is to determine the largest possible size $ A_q(n, d; k) $ of codes whose codewords are $ k $-subspaces of $ {\mathbb F}_q^n $ with minimum subspace distance $ d $. Here in order to obtain improved constructions, we investigate several approaches to combine subspace codes. This allow us to present improvements on the lower bounds for constant-dimension subspace codes for many parameters, including $ A_q(10, 4; 5) $, $ A_q(12, 4; 4) $, $ A_q(12, 6, 6) $ and $ A_q(16, 4; 4) $.

1 April 2020 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
Giuseppe MarinoGiuseppe Marino
Giuseppe Marino
MMMaria Montanucci
Maria Montanucci
FZFerdinando Zullo
Ferdinando Zullo

21 March 2008 in Journal of Combinatorial Theory, Series A
Verified
Journal Article
Closed access
GLGuglielmo Lunardon
Guglielmo Lunardon
Giuseppe MarinoGiuseppe Marino
Giuseppe Marino
OPOlga Polverino
Olga Polverino
RTRocco Trombetti
Rocco Trombetti

16 July 2022 in Annali di Matematica Pura ed Applicata (1923 -)
Verified
Journal Article
Open access
PDF file
DBDaniele Bartoli
Daniele Bartoli
Giuseppe MarinoGiuseppe Marino
Giuseppe Marino
ANAlessandro Neri
Alessandro Neri
Minimal rank-metric codes or, equivalently, linear cutting blocking sets are characterized in terms of the second generalized rank weight, via their connection with evasiveness properties of the associated q-system. Using this result, we provide the first construction of a family of $$\mathbb F_{q^m}$$ F q m -linear MRD codes of length 2m that are not obtained as a direct sum of two smaller MRD codes. In addition, such a family has better parameters, since its codes possess generalized rank weights strictly larger than those of the previously known MRD codes. This shows that not all the MRD codes have the same generalized rank weights, in contrast to what happens in the Hamming metric setting.