## Events Search and Views Navigation

## April 2017

### Manami Roy – University of Oklahoma

Level of Siegel modular forms of degree 2 coming from the $latex Sym^3$ lifting Ramakrishnan and Shahidi used the $latex Sym^3$ lifting to lift a holomorphic elliptic (non-CM) newform $latex f$ of weight $latex 2k$ and level $latex N$ to…

Find out more »### Jessalyn Bolkema – University of Nebraska-Lincoln

The tensor-like join: graph-theoretic insights into polar code performance Arikan's polar codes have been celebrated for their capacity-achieving performance since first presented in 2008; however, the question of optimal finite-length design and decoding remains open. To understand the efficacy of…

Find out more »### Jessalyn Bolkema – University of Nebraska-Lincoln

The tensor-like join: graph-theoretic insights into polar code performance Arikan's polar codes have been celebrated for their capacity-achieving performance since first presented in 2008; however, the question of optimal finite-length design and decoding remains open. To understand the efficacy of…

Find out more »## September 2017

### Introductory lecture

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 »### Catherine Hsu – University of Oregon

Higher Eisenstein Congruences In this talk, we examine the relationship between the ``depth" of certain Eisenstein congruences and the local structure of the Eisenstein ideal. Specifically, let $latex p\geq 3$ be prime. For squarefree level $latex N>6$ and weight $latex…

Find out more »## 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 »