9 papers
An Upper Bound to the Undetected Error Exponent with Erasure Decoding at Positive Rates
Seyed AmirPouya Moeini, Marco Dalai, Albert Guillén i Fàbregas
We study the undetected-error exponent of discrete memoryless channels with erasure decoding. Assuming that the undetected-error and erasure probabilities vanish, we derive an uppe…
The Expurgated Error Exponent is Not Universally Achievable
Seyed AmirPouya Moeini, Marco Dalai, Albert Guillén i Fàbregas
We study the universal attainability of the expurgated error exponent for discrete memoryless channels (DMCs). While the random-coding exponent is known to be universally attainabl…
Zero-Error List Decoding for Classical-Quantum Channels
Marco Dalai, Filippo Girardi, Ludovico Lami
The aim of this work is to study the zero-error capacity of pure-state classical-quantum channels in the setting of list decoding. We provide an achievability bound for list-size t…
Definability of some -ary Relations Over Second Order kinds of Logics
Simone Costa, Marco Dalai, Stefano Della Fiore +1
We consider the exprissibility in monadic second order logic of certain relations of importance in computer science. For integers and , a -tuple of sequences…
Bounds on -hash distances and rates of linear codes
Stefano Della Fiore, Marco Dalai
In this paper, we bound the rate of linear codes in with the property that any codewords are all simultaneously distinct in at least coordinates. F…
End-to-End Semantic Preservation in Text-Aware Image Compression Systems
Stefano Della Fiore, Alessandro Gnutti, Marco Dalai +2
Traditional image compression methods aim to reconstruct images for human perception, prioritizing visual fidelity over task relevance. In contrast, Coding for Machines focuses on…
An Efficient Algorithm for Group Testing with Runlength Constraints
Marco Dalai, Stefano Della Fiore, Adele A. Rescigno +1
In this paper, we provide an efficient algorithm to construct almost optimal -superimposed codes with runlength constraints. A -superimposed code of length is…
Upper bounds on the rate of linear -ary -hash codes
Stefano Della Fiore, Marco Dalai
This paper presents new upper bounds on the rate of linear -hash codes in , , that is, codes with the property that any distinct codewords are all s…
A gap in the slice rank of -tensors
Simone Costa, Marco Dalai
The slice-rank method, introduced by Tao as a symmetrized version of the polynomial method of Croot, Lev and Pach and Ellenberg and Gijswijt, has proved to be a useful tool in a va…