21
TITLE: Non-Asymptotic Capacity Upper Bounds for the Discrete-Time Poisson Channel With Positive Dark Current  Full Text
AUTHORS: Cheraghchi, M; Ribeiro, J;
PUBLISHED: 2021, SOURCE: IEEE COMMUNICATIONS LETTERS, VOLUME: 25, ISSUE: 12
INDEXED IN: Scopus WOS
22
TITLE: How to Extract Useful Randomness from Unreliable Sources
AUTHORS: Divesh Aggarwal; Maciej Obremski; João Ribeiro; Luisa Siniscalchi; Ivan Visconti;
PUBLISHED: 2020, SOURCE: Advances in Cryptology – EUROCRYPT 2020 - Lecture Notes in Computer Science
INDEXED IN: CrossRef: 7
IN MY: ORCID
23
TITLE: Group Testing with Runlength Constraints for Topological Molecular Storage
AUTHORS: Abhishek Agarwal; Olgica Milenkovic; Srilakshmi Pattabiraman; Joao Ribeiro;
PUBLISHED: 2020, SOURCE: 2020 IEEE International Symposium on Information Theory (ISIT)
INDEXED IN: CrossRef: 4
IN MY: ORCID
24
TITLE: Coded Trace Reconstruction
AUTHORS: Mahdi Cheraghchi; Ryan Gabrys; Olgica Milenkovic; Joao Ribeiro;
PUBLISHED: 2020, SOURCE: IEEE Transactions on Information Theory, VOLUME: 66, ISSUE: 10
INDEXED IN: CrossRef: 39
IN MY: ORCID
25
TITLE: Extractor lower bounds, revisited
AUTHORS: Divesh Aggarwal; Siyao Guo; Maciej Obremski; João Ribeiro; Noah Stephens Davidowitz;
PUBLISHED: 2020, SOURCE: Leibniz International Proceedings in Informatics, LIPIcs, VOLUME: 176
INDEXED IN: Scopus
26
TITLE: Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures
AUTHORS: Divesh Aggarwal; Ivan Damgård; Jesper Buus Nielsen; Maciej Obremski; Erick Purwanto; João Ribeiro; Mark Simkin;
PUBLISHED: 2019, SOURCE: Advances in Cryptology – CRYPTO 2019 - Lecture Notes in Computer Science
INDEXED IN: CrossRef: 28
IN MY: ORCID
27
TITLE: Simple Codes and Sparse Recovery with Fast Decoding
AUTHORS: Mahdi Cheraghchi; Joao Ribeiro;
PUBLISHED: 2019, SOURCE: 2019 IEEE International Symposium on Information Theory (ISIT)
INDEXED IN: CrossRef: 1
IN MY: ORCID
28
TITLE: Coded Trace Reconstruction
AUTHORS: Mahdi Cheraghchi; Joao Ribeiro; Ryan Gabrys; Olgica Milenkovic;
PUBLISHED: 2019, SOURCE: 2019 IEEE Information Theory Workshop (ITW)
INDEXED IN: CrossRef: 11
IN MY: ORCID
29
TITLE: Improved Upper Bounds and Structural Results on the Capacity of the Discrete-Time Poisson Channel
AUTHORS: Mahdi Cheraghchi; Joao Ribeiro;
PUBLISHED: 2019, SOURCE: IEEE Transactions on Information Theory, VOLUME: 65, ISSUE: 7
INDEXED IN: CrossRef: 10
IN MY: ORCID
30
TITLE: Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels
AUTHORS: Mahdi Cheraghchi; Joao Ribeiro;
PUBLISHED: 2019, SOURCE: IEEE Transactions on Information Theory, VOLUME: 65, ISSUE: 11
INDEXED IN: CrossRef: 4
IN MY: ORCID
Page 3 of 4. Total results: 34.