The following pages link to Marco Dalai (Q1752306):
Displaying 22 items.
- A note on random coding bounds for classical-quantum channels (Q1752307) (← links)
- A gap in the slice rank of \(k\)-tensors (Q2005208) (← links)
- A note on \(\overline{2} \)-separable codes and \(B_2\) codes (Q2065925) (← links)
- A theory of the risk for empirical CVaR with application to portfolio selection (Q2070025) (← links)
- Variations on the Erdős distinct-sums problem (Q2104936) (← links)
- New bounds for perfect \(k\)-hashing (Q2217492) (← links)
- Parameter identification for nonlinear systems: guaranteed confidence regions through LSCR (Q2467503) (← links)
- Recurrence relations for the Lerch \(\Phi\)-function and applications (Q2492107) (← links)
- Elias Bound for General Distances and Stable Sets in Edge-Weighted Graphs (Q2978608) (← links)
- On Unique Decodability (Q3604879) (← links)
- Approximations of One-Dimensional Digital Signals Under the$l^infty$Norm (Q4587895) (← links)
- Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels (Q4589396) (← links)
- Bounds on the Reliability Function of Typewriter Channels (Q4682908) (← links)
- How Would Riemann Evaluate ζ(2<em>n</em>)? (Q4921858) (← links)
- Mismatched Decoding Reliability Function at Zero Rate (Q5080007) (← links)
- A Revisitation of Low-Rate Bounds on the Reliability Function of Discrete Memoryless Channels for List Decoding (Q5088424) (← links)
- Improved Bounds for (b, k)-Hashing (Q5096965) (← links)
- A tour problem on a toroidal board (Q5109060) (← links)
- An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel (Q5211632) (← links)
- Lower Bounds on the Probability of Error for Classical and Classical-Quantum Channels (Q5346207) (← links)
- Upper bounds on the rate of linear $q$-ary $k$-hash codes (Q6519397) (← links)
- An efficient algorithm for group testing with runlength constraints (Q6648259) (← links)
