M. Dalai

activity

20042023

most citedLower bounds on the Probability of Error for Classical and Classical-Quantum Channels

66 citations · 131 across the 23 of their papers we have counts for

collaborators

26 papers

cs.IT2023

Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures

Marco Dalai, Stefano Della Fiore, Adele A. Rescigno +1

In this paper, we study upper bounds on the minimum length of frameproof codes introduced by Boneh and Shaw to protect copyrighted materials. A $q$ -ary $(k, n)$ -frameproof code of l…

cs.IT2022★ 1 cited

Achievable Rates and Algorithms for Group Testing with Runlength Constraints

Stefano Della Fiore, Marco Dalai, Ugo Vaccaro

In this paper, we study bounds on the minimum length of $(k, n, d)$ -superimposed codes introduced by Agarwal et al. [1], in the context of Non-Adaptive Group Testing algorithms with…

math.CO2021

Variations on the Erdős distinct-sums problem

Simone Costa, Marco Dalai, Stefano Della Fiore

Let ${a_{1}, ..., a_{n}}$ be a set of positive integers with $a_{1} < \dots < a_{n}$ such that all $2^{n}$ subset sums are distinct. A famous conjecture by Erdős states that $a_n>c\cdot…

math.CO2021

A note on $2$ -separable codes and $B_{2}$ codes

Stefano Della Fiore, Marco Dalai

We derive a simple proof, based on information theoretic inequalities, of an upper bound on the largest rates of $q$ -ary $2$ -separable codes that improves recent results…

cs.IT2021

New upper bounds for $(b, k)$ -hashing

Stefano Della Fiore, Simone Costa, Marco Dalai

For fixed integers $b \geq k$ , the problem of perfect $(b, k)$ -hashing asks for the asymptotic growth of largest subsets of ${1, 2, \dots, b}^{n}$ such that for any $k$ distinct elemen…

cs.IT2021

Mismatched decoding reliability function at zero rate

Marco Bondaschi, Albert Guillén i Fàbregas, Marco Dalai

We derive an upper bound on the reliability function of mismatched decoding for zero-rate codes. The bound is based on a result by Komlós that shows the existence of a subcode with…