Marco Dalai

activity

20192026

collaborators

Showing cs.ITShow all

4 papers · 1 filter

cs.IT2026

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…

cs.IT2025

Bounds on $k$ -hash distances and rates of linear codes

Stefano Della Fiore, Marco Dalai

In this paper, we bound the rate of linear codes in $F_{q}^{n}$ with the property that any $k \leq q$ codewords are all simultaneously distinct in at least $d_{k}$ coordinates. F…

cs.IT2024

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 $(k, n, d)$ -superimposed codes with runlength constraints. A $(k, n, d)$ -superimposed code of length $t$ is…

cs.IT2024

Upper bounds on the rate of linear $q$ -ary $k$ -hash codes

Stefano Della Fiore, Marco Dalai

This paper presents new upper bounds on the rate of linear $k$ -hash codes in $F_{q}^{n}$ , $q \geq k$ , that is, codes with the property that any $k$ distinct codewords are all s…

The Expurgated Error Exponent is Not Universally Achievable

Bounds on k-hash distances and rates of linear codes

An Efficient Algorithm for Group Testing with Runlength Constraints

Upper bounds on the rate of linear q-ary k-hash codes

Bounds on $k$ -hash distances and rates of linear codes

Upper bounds on the rate of linear $q$ -ary $k$ -hash codes