| Multivariate mutual information inspired by secret-key agreement C Chan, A Al-Bashabsheh, JB Ebrahimi, T Kaced, T Liu Proceedings of the IEEE 103 (10), 1883-1913, 2015 | 73 | 2015 |
| Group testing with prior statistics T Li, CL Chan, W Huang, T Kaced, S Jaggi 2014 IEEE International Symposium on Information Theory, 2346-2350, 2014 | 60 | 2014 |
| On the information ratio of non-perfect secret sharing schemes O Farrās, TB Hansen, T Kaced, C Padrķ Algorithmica 79, 987-1013, 2017 | 43 | 2017 |
| Info-clustering: A mathematical theory for data clustering C Chan, A Al-Bashabsheh, Q Zhou, T Kaced, T Liu IEEE Transactions on Molecular, Biological, and Multi-Scale Communications 2 …, 2016 | 41 | 2016 |
| Successive omniscience C Chan, A Al-Bashabsheh, Q Zhou, N Ding, T Liu, A Sprintson IEEE Transactions on Information Theory 62 (6), 3270-3289, 2016 | 36 | 2016 |
| Equivalence of two proof techniques for non-Shannon-type inequalities T Kaced 2013 IEEE International Symposium on Information Theory, 236-240, 2013 | 31 | 2013 |
| Improving the linear programming technique in the search for lower bounds in secret sharing O Farrās, T Kaced, S Martín, C Padrķ Annual International Conference on the Theory and Applications of …, 2018 | 30 | 2018 |
| Conditional Information Inequalities for Entropic and Almost Entropic Points T Kaced, A Romashchenko arXiv preprint arXiv:1207.5742, 2012 | 27 | 2012 |
| Optimal non-perfect uniform secret sharing schemes O Farras, T Hansen, T Kaced, C Padrķ Advances in Cryptology–CRYPTO 2014: 34th Annual Cryptology Conference, Santa …, 2014 | 23 | 2014 |
| Improving the linear programming technique in the search for lower bounds in secret sharing O Farrās, T Kaced, S Martín, C Padrķ IEEE Transactions on Information Theory 66 (11), 7088-7100, 2020 | 21 | 2020 |
| Almost-perfect secret sharing T Kaced Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on …, 2011 | 19 | 2011 |
| Information inequalities are not closed under polymatroid duality T Kaced IEEE Transactions on Information Theory 64 (6), 4379-4381, 2018 | 14 | 2018 |
| A conditional information inequality and its combinatorial applications T Kaced, A Romashchenko, N Vereshchagin IEEE Transactions on Information Theory 64 (5), 3610-3615, 2018 | 10 | 2018 |
| On essentially conditional information inequalities T Kaced, A Romashchenko Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on …, 2011 | 9 | 2011 |
| Secret Sharing and Algorithmic Information Theory.(Partage de secret et the'orie algorithmique de l'information). T Kaced Montpellier 2 University, France, 2012 | 7 | 2012 |
| On the Non-robustness of Essentially Conditional Information Inequalities T Kaced, A Romashchenko arXiv preprint arXiv:1207.5458, 2012 | 6 | 2012 |
| Secret sharing and algorithmic information theory T Kaced Université Montpellier II-Sciences et Techniques du Languedoc, 2012 | 5* | 2012 |
| Conditional and unconditional information inequalities: an algebraic example T Kaced, A Romashchenko arXiv preprint arXiv:1201.6398, 2012 | 1 | 2012 |
| Optimal non-perfect uniform secret sharing schemes O Farrās Ventura, T Hansen, T Kaced, C Padrķ Laimon Springer, 0 | | |
Carles PadroDepartment of Mathematics, Universitat Politčcnica de CatalunyaVerified email at upc.edu
