Synthical
Your space
Profile
Activity
Favorites
Folders
Feeds
All articles
Simple
Original
Articles by
Marco Dalai
Upper bounds on the rate of linear
q
-ary
k
-hash codes
15 May 2024 by
Stefano Della Fiore
and
Marco Dalai
Information Theory
,
Combinatorics
Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures
13 March 2023 by
Marco Dalai
and
others
at
University of Brescia
Information Theory
,
Data Structures and Algorithms
Achievable Rates and Algorithms for Group Testing with Runlength Constraints
30 August 2022 by
Stefano Della Fiore
and
others
Information Theory
,
Data Structures and Algorithms
Variations on the Erdős distinct-sums problem
19 July 2021 by
Simone Costa
and
others
Combinatorics
,
Number Theory
A note on
\overline{2}
-separable codes and
B_2
codes
24 June 2021 by
Stefano Della Fiore
and
Marco Dalai
Combinatorics
Improved Bounds for
(b,k)
-hashing
3 May 2021 by
Stefano Della Fiore
and
others
Combinatorics
,
Information Theory
A revisitation of zero-rate bounds on the reliability function of discrete memoryless channels
2 April 2021 by
Marco Bondaschi
and
Marco Dalai
Information Theory
New upper bounds for
(b,k)
-hashing
26 January 2021 by
Stefano Della Fiore
and
others
Information Theory
,
Combinatorics
Zero-rate reliability function for mismatched decoding
26 January 2021 by
Marco Bondaschi
and
others
Information Theory
New bounds for perfect
k
-hashing
25 February 2020 by
Simone Costa
and
Marco Dalai
Combinatorics
,
Information Theory
A tour problem on a toroidal board
29 August 2019 by
Simone Costa
and
others
Combinatorics
A gap in the slice rank of
k
-tensors
13 August 2019 by
Simone Costa
and
Marco Dalai
Combinatorics
Bounds on the reliability of typewriter channels
31 October 2017 by
Marco Dalai
and
Y. Polyanskiy
Information Theory
,
Combinatorics
Nonasymptotic coding-rate bounds for binary erasure channels with feedback
22 July 2016 by
Rahul Devassy
and
others
Information Theory
Rate-distance tradeoff for codes above graph capacity
21 July 2016 by
Daniel Cullina
and
others
Information Theory
Bounds on the Reliability of a Typewriter Channel
18 July 2016 by
Marco Dalai
and
Yury Polyanskiy
Information Theory
,
Combinatorics
Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels
2 September 2015 by
Marco Dalai
and
Andreas Winter
Information Theory
,
Quantum Physics
Bounds for codes on pentagon and other cycles
12 August 2015 by
Marco Dalai
and
Yury Polyanskiy
Combinatorics
,
Information Theory
Elias Bound for General Distances and Stable Sets in Edge-Weighted Graphs
4 March 2015 by
Marco Dalai
Information Theory
,
Combinatorics
Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels
28 April 2014 by
Marco Dalai
and
Andreas Winter
Information Theory
,
Quantum Physics
An Elias Bound on the Bhattacharyya Distance of Codes for Channels with a Zero-Error Capacity
28 April 2014 by
Marco Dalai
Information Theory
,
Combinatorics
Lovász's Theta Function, Rényi's Divergence and the Sphere-Packing Bound
20 May 2013 by
Marco Dalai
Information Theory
,
Quantum Physics
An "Umbrella" Bound of the Lovász-Gallager Type
20 May 2013 by
Marco Dalai
Information Theory
Sphere Packing and Zero-Rate Bounds to the Reliability of Classical-Quantum Channels
2 July 2012 by
Marco Dalai
Information Theory
,
Quantum Physics
How would Riemann evaluate
ζ(2n)
?
16 February 2012 by
Marco Dalai
History and Overview
,
Classical Analysis and ODEs
A new bound for the capacity of the deletion channel with high deletion probabilities
15 February 2012 by
Marco Dalai
Information Theory
On Unique Decodability
5 September 2008 by
Marco Dalai
and
Riccardo Leonardi
Information Theory
Non prefix-free codes for constrained sequences
10 June 2005 by
Marco Dalai
and
Riccardo Leonardi
Information Theory
Recurrence relations for the Lerch Phi function and applications
4 November 2004 by
Marco Dalai
Number Theory
,
Complex Variables