Tarik Kaced
Tarik Kaced
Post-doctoral fellow at INC, CUHK.
Verified email at ens-lyon.org - Homepage
Title
Cited by
Cited by
Year
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
622015
On the information ratio of non-perfect secret sharing schemes
O Farras, TB Hansen, T Kaced, C Padró
Algorithmica 79 (4), 987-1013, 2017
312017
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
312016
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
302016
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
302014
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
242018
Equivalence of two proof techniques for non-Shannon-type inequalities
T Kaced
2013 IEEE International Symposium on Information Theory, 236-240, 2013
222013
Optimal non-perfect uniform secret sharing schemes
O Farras, T Hansen, T Kaced, C Padró
Annual Cryptology Conference, 217-234, 2014
182014
Conditional Information Inequalities for Entropic and Almost Entropic Points
T Kaced, A Romashchenko
arXiv preprint arXiv:1207.5742, 2012
162012
Almost-perfect secret sharing
T Kaced
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on …, 2011
162011
A conditional information inequality and its combinatorial applications
T Kaced, A Romashchenko, N Vereshchagin
IEEE Transactions on Information Theory 64 (5), 3610-3615, 2018
92018
On essentially conditional information inequalities
T Kaced, A Romashchenko
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on …, 2011
92011
Information inequalities are not closed under polymatroid duality
T Kaced
IEEE Transactions on Information Theory 64 (6), 4379-4381, 2018
72018
Secret Sharing and Algorithmic Information Theory.(Partage de secret et the'orie algorithmique de l'information).
T Kaced
Montpellier 2 University, France, 2012
72012
On the Non-robustness of Essentially Conditional Information Inequalities
T Kaced, A Romashchenko
arXiv preprint arXiv:1207.5458, 2012
62012
Improving the linear programming technique in the search for lower bounds in secret sharing
O Farràs, T Kaced, S Martín, C Padro
IEEE Transactions on Information Theory 66 (11), 7088-7100, 2020
32020
Secret sharing and algorithmic information theory
T Kaced
Université Montpellier II-Sciences et Techniques du Languedoc, 2012
3*2012
Conditional and unconditional information inequalities: an algebraic example
T Kaced, A Romashchenko
arXiv preprint arXiv:1201.6398, 2012
12012
The system can't perform the operation now. Try again later.
Articles 1–18