Date | Topic | Reader |
---|---|---|
13/03 | Codes for Caching based on [1] | Nitish Mital |
13/02 | Codes for Cloud Storage based on [2] | Antonio Campello |
20/02 | Codes for Gaussian Relay Networks Degrees-of-freedom and diophantine approximations, based on [3] | Shanxiang Lyu |
27/02 | Polar codes for 5G Based on [4,5] | Jinwen Shi |
06/03 | Quantum Polar Codes Based on [6] | Jiabo Wang |
13/03 | Codes for the Multiple-Access Channel 1 based on [7] | Cong Ling |
20/03 | Codes for the Multiple-Access Channel 2 based on [8] | Antonio Campello |
27/03 | Reed-Muller Codes Capacity-Achieving in the BEC | Ling Liu |
03/04 | LWE over Division Algebras based on [9] and [10] | Charlie Grover |
Suplementary bibliography
[1] Maddah-Ali, M. and Niesen, U. "Fundamental Limits of Caching", IEEE Transactions on Information Theory, 2014 (links here or here)
[2] Dimakis et al. "Network Coding for Distributed Storage Systems", IEEE Transactions on Information Theory 2010, (link)
[3] Niesen, U., & Whiting, P. The degrees of freedom of compute-and-forward. IEEE Transactions on Information Theory, 2012. (link)
[4-5] "Minimum-Distance Based Construction of Multi-Kernel Polar Codes" and "Multi-Kernel Construction of Polar Codes" (links here and here).
[6] Mark M. Wilde, Saikat Guha, "Polar Codes for Classical-Quantum Channels", IEEE Transactions on Information theory, 2013. (link)
[7] D. Tse, P. Viswanath and L. Zheng, Diversity-Multiplexing Tradeoff in Multiple Access Channels, IEEE Transactions on Information Theory, 2004. (link)
[8] J. Zhu and M. Gastpar, "Gaussian Multiple Access via Compute-and-Forward," in IEEE Transactions on Information Theory, 2016 (link)
[9] V. Lyubashevsky, C. Peikert, and O. Regev, "On Ideal Lattices and Learning with Errors Over Rings". Journal of the ACM, 60(6):43:1-43:35, November 2013. Preliminary version in EUROCRYPT '10. (link)
[10] L. Luzzi, R. Vehkalatti and C. Ling "Almost universal codes for MIMO wiretap channels", 2016 (link)