Moderator:
Reza Sobhani(r.sobhani@sci.ac.ir)

In this talk, I will briefly introduce Euclidean lattices. I will then summarize the (hard) problems related to lattices
in Mathematics, Computer Science, and Wireless Communications. I will then present some wellknown structured and unstructured
latticebased encryption schemes.

Cyclic codes are important classes of linear codes due to their rich algebraic structure. In this talk I present a structure for the repeatedroot cyclic codes based on
a combinatorial structure called matrixproduct structure.

In this talk, I introduce two classes of LowDensity ParityCheck (LDPC) codes based on affine permutation matrices and Mobius transformation.
I discuss some advantages of these codes in comparision with quasicyclic LDPC codes.

