## Events Search and Views Navigation

## October 2017

### Introductory lecture by Hiram López

The introductory lecture is aimed at sharing background material so that students are better prepared to understand the main seminar. The introductory lecture is open only to students.

Find out more »### Heide Gluesing-Luerssen – University of Kentucky

On Ferrers Diagram Codes Rank-metric codes play a crucial role in the area of random network coding. Mathematically, they are subspaces of a matrix space $latex \mathbb{F}^{m\times n}$ over a finite field $latex \mathbb{F}$, and where the matrix space is…

Find out more »### Carolyn Mayer – University of Nebraska-Lincoln

Coding Techniques for Partial Erasure Channels. Partial erasure channels were recently introduced to model erasure events in applications such as flash memories. In these channels, some information may remain after an erasure event. After reviewing these channels, we present results…

Find out more »### Changan Zhao – Clemson University

Efficient computations of bilinear pairings on elliptic curves over finite fields. The Tate and Weil pairings play a vital role in computational number theory. For example, the Weil pairing can be used to determine the group structure of an elliptic…

Find out more »## November 2017

### Edoardo Persichetti – Florida Atlantic University

Code-based Cryptography for Post-Quantum Standardization In this talk, I will discuss some of the most recent developments in code-based cryptography and present the main candidates for NIST's post-quantum standardization call.

Find out more »## December 2017

### Solly Parenti – University of Wisconsin-Madison

The Colmez Conjecture The Faltings height of an abelian variety is a fundamental invariant that was introduced in the proof of the Mordell conjecture. Pierre Colmez formulated a conjectural interpretation of the Faltings height of a CM abelian variety in…

Find out more »## March 2018

### Gauri Joshi – Carnegie Mellon University

Distributed Storage Erasure codes, originally designed to provide reliability against noise on communication channels, are now widely used in distributed storage systems. Distributed storage systems require the codes to have new properties such as low-cost repair of failed nodes, high…

Find out more »### Gauri Joshi – Carnegie Mellon University

Coded Computing Large-scale distribute computing frameworks such as MapReduce and Spark employ massive parallelization of jobs. While parallelism drastically reduces computation time, slow or straggling nodes can become a bottleneck in job completion. In this talk, we will study erasure codes for…

Find out more »### Gauri Joshi – Carnegie Mellon University

Rateless Codes Rateless fountain codes are a class of erasure codes where the source generates an unlimited stream of symbols until the data is recovered at the receiver. This rateless property makes them well-suited for many applications including multicast communication, distributed…

Find out more »## April 2018

### Melvyn Nathanson – City University of New York

Solved and unsolved problems in additive number theory This will be a survey of recent results in combinatorial and additive number theory. The central object is the set of sums of elements in a finite or infinite set of integers. This…

Find out more »