Doron, Dean

1. When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?
   2024/05/14 by Doron, Dean, Mosheiff, Jonathan, Wootters, Mary · 1 citation
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Information Theory (cs.IT)
2. Nearly-Linear Time Seeded Extractors with Short Seeds
   2024/11/12 by Dean Doron, Doron, Dean, Ribeiro, João · 1 citation
   Chemical Engineering · Chemistry · #Analytical Chemistry and Chromatography #Analytical Chemistry and Sensors #Computational Complexity (cs.CC) #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT)