| Publication | Date of Publication | Type |
|---|
Upper bounds on the rate of linear q-ary k-hash codes
(available as arXiv preprint) | N/A | Paper |
Bounds on k-hash distances and rates of linear codes
IEEE Transactions on Information Theory | 2026-03-18 | Paper |
An efficient algorithm for group testing with runlength constraints
Discrete Applied Mathematics | 2024-12-04 | Paper |
Variations on the Erdős distinct-sums problem
Discrete Applied Mathematics | 2022-12-08 | Paper |
| Achievable Rates and Algorithms for Group Testing with Runlength Constraints | 2022-08-30 | Paper |
Improved Bounds for (b, k)-Hashing
IEEE Transactions on Information Theory | 2022-08-19 | Paper |
A Revisitation of Low-Rate Bounds on the Reliability Function of Discrete Memoryless Channels for List Decoding
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Mismatched Decoding Reliability Function at Zero Rate
IEEE Transactions on Information Theory | 2022-05-30 | Paper |
A theory of the risk for empirical CVaR with application to portfolio selection
Journal of Systems Science and Complexity | 2022-01-21 | Paper |
A note on \(\overline{2} \)-separable codes and \(B_2\) codes
Discrete Mathematics | 2022-01-13 | Paper |
Variations on the Erd\H{o}s distinct-sums problem
(available as arXiv preprint) | 2021-07-16 | Paper |
| New upper bounds for (b,k)-hashing | 2021-01-26 | Paper |
New bounds for perfect \(k\)-hashing
Discrete Applied Mathematics | 2020-12-29 | Paper |
A gap in the slice rank of \(k\)-tensors
Journal of Combinatorial Theory. Series A | 2020-10-07 | Paper |
A tour problem on a toroidal board
(available as arXiv preprint) | 2020-05-07 | Paper |
| A tour problem on a toroidal board | 2020-05-07 | Paper |
An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Bounds on the Reliability Function of Typewriter Channels
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
A note on random coding bounds for classical-quantum channels
Problems of Information Transmission | 2018-05-24 | Paper |
Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels
IEEE Transactions on Information Theory | 2017-11-10 | Paper |
Approximations of One-Dimensional Digital Signals Under the$l^infty$Norm
IEEE Transactions on Signal Processing | 2017-10-30 | Paper |
Lower Bounds on the Probability of Error for Classical and Classical-Quantum Channels
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Elias Bound for General Distances and Stable Sets in Edge-Weighted Graphs
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
| Bounds on the reliability of typewriter channels | 2017-02-24 | Paper |
| Bounds on the Reliability of a Typewriter Channel | 2016-07-18 | Paper |
| Bounds for codes on pentagon and other cycles | 2015-08-12 | Paper |
| An Elias Bound on the Bhattacharyya Distance of Codes for Channels with a Zero-Error Capacity | 2014-01-10 | Paper |
How would Riemann evaluate \(\zeta (2n)\)?
The American Mathematical Monthly | 2013-05-28 | Paper |
On Unique Decodability
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Parameter identification for nonlinear systems: guaranteed confidence regions through LSCR
Automatica | 2008-01-21 | Paper |
Recurrence relations for the Lerch \(\Phi\)-function and applications
Zeitschrift für Analysis und ihre Anwendungen | 2006-06-06 | Paper |
