.01

PERSONAL DETAILS
Clemson University, Clemson, SC 29631
+1 (864) 656-1657
office: Martin Hall O-22
O-110 Martin Hall, Box 340975, Clemson, SC 29634

### BIO

I am an Associate Professor of the School of Mathematical and Statistical Sciences of Clemson University. For the academic year 2019/20 I have been a Visiting Scholar of the Ted Rogers School of Management of Ryerson University where I joined the Cybersecurity Research Lab.

.02

## RESUME

• 2019
Clemson, USA

### ASSOCIATE PROFESSOR

#### CLEMSON UNIVERSITY

School of mathematical and Statistical Sciences
• 2019
2020

### VISITING SCHOLAR

#### RYERSON  UNIVERSITY

Cybersecurity Lab, TED ROGERS School of Management
• 2013
2019
Clemson, USA

### ASSISTANT PROFESSOR

#### CLEMSON UNIVERSITY

School of mathematical and Statistical Sciences
• 2011
2013

### POSTDOCTORAL FELLOW

#### UNIVERSITY OF TORONTO

Department of Electrical and Computer Engineering
• OTHER AFFILIATIONS
• 2006
2011

### AFFILIATED FACULTY

#### RYERSON UNIVERSITY

Cybersecurity Research Lab (CRL)
• EDUCATION
• 2006
2011
ZURICH, SWITZERLAND

### MATHEMATICS - DR. SC. NAT (PHD)

#### UNIVERSITY OF ZURICH

Title: Spread Codes and more General Network Codes.
• 1999
2005
PISA, ITALY

### MATHEMATICS

#### UNIVERSITY OF PISA

title: Calcolo della distribuzione dei pesi nei codici ciclici accorciati.
.03

## PUBLICATIONS

PUBLICATIONS LIST
2021

### INTERFERENCE ALIGNMENT IN MULTIPLE UNICAST NETWORKS OVER FINITE FIELDS

#### Submitted.

Jornal Paper with F. Kschischang, A. Ravagnani and K. Savary

### INTERFERENCE ALIGNMENT IN MULTIPLE UNICAST NETWORKS OVER FINITE FIELDS

F. Kschischang, F. Manganiello, A. Ravagnani and K. Savary Journal Paper

2021

### RECURSIVE EDGE TOGGLING FOR CONSTRUCTION OF DE BRUIJN SEQUENCES

#### Submitted.

Conference Proceedings with T. Baumbaugh

### RECURSIVE EDGE TOGGLING FOR CONSTRUCTION OF DE BRUIJN SEQUENCES

T. Baumbaugh and F. Manganiello Conference Proceedings

De Bruijn sequences are cyclic sequences of length $2^n$ that contain every binary word of length $n$ exactly once. The construction of many such sequences of a given order is useful for the generation of stream ciphers. One method of constructing sequences makes use of a homomorphism from the de Bruijn graph of order $n$ to the graph of order $n-1$. The preimages of a de Bruijn sequence under this homomorphism form two cycles which may be joined at certain points. We examine a par- ticular method for identifying such points when the sequence in question is recursively constructed in this manner. Using the structure of the con- struction, we are able to calculate sums of subsequences in $\mathcal{O}( n^4 log(n))$􏰁 time, and the location of a given word in $\mathcal{O}(n^5 log(n))$ time. Together, these functions allow a check to be made for the validity of any potential toggle point. This provides a method for efficiently generating a recursive specification for such sequences, each successful step of which takes $\mathcal{O}(k^5 log(k))$, for $k$ from 3 to n.

15 JAN 2021

### A PARALLEL JACOBI-EMBEDDED GAUSS-SEIDEL METHOD.

#### IEEE Transactions on Parallel and Distributed Systems, 32(6):1452–1464.

Find it in the journal.

### A PARALLEL JACOBI-EMBEDDED GAUSS-SEIDEL METHOD.

A. Ahmadi, F. Manganiello, A. Khademi, and M. C. Smith Journal Paper

A broad range of scientific simulations involve solving large-scale computationally expensive linear systems of equations. Iterative solvers are typically preferred over direct methods when it comes to large systems due to their lower memory requirements and shorter execution times. However, selecting the appropriate iterative solver is problem-specific and dependent on the type and symmetry of the coefficient matrix. Gauss-Seidel (GS) is an iterative method for solving linear systems that are either strictly diagonally dominant or symmetric positive definite. This technique is an improved version of Jacobi and typically converges in fewer iterations. However, the sequential nature of this algorithm complicates the parallel extraction. In fact, most parallel derivatives of GS rely on the sparsity pattern of the coefficient matrix and require matrix reordering or domain decomposition. In this article, we introduce a new algorithm that exploits the convergence property of GS and adapts the parallel structure of Jacobi. The proposed method works for both dense and sparse systems and is straightforward to implement. We have examined the performance of our method on multicore and many-core architectures. Experimental results demonstrate the superior performance of the proposed algorithm compared with GS and Jacobi. Additionally, performance comparison with built-in Krylov solvers in MATLAB showed that in terms of time per iteration, Krylov methods perform faster on CPUs, but our approach is significantly better when executed on GPUs. Lastly, we apply our method to solve the power flow problem, and the results indicate a significant improvement in runtime, reaching up to 87 times faster speed compared with GS.

1 OCT 2020

### HILBERT MODULAR FORMS AND CODES OVER ${\bf F}_{p^2}$

#### Finite Fields and Their Applications, 67:101731.

Find it in the journal.

Journal Paper with J. Brown, J. Lilly and B. Gunsolus

### HILBERT MODULAR FORMS AND CODES OVER ${\bf F}_{p^2}$

J. Brown, J. Lilly, B. Gunsolus and F. Manganiello Journal Paper

Let $p$ be an odd prime and consider the finite field $\mathbb{F}_{p^2}$. Given a linear code $\mathcal{C} \subset \mathbb{F}^{n}_{p^2}$, we use algebraic number theory to construct an associated lattice $\Lambda_{\mathcal{C}} \subset \mathcal{O}_{L}^{n}$ for $L$ an algebraic number field and $\mathcal{O}_{L}$ the ring of integers of $L$. We attach a theta series $\theta_{\Lambda_{\mathcal{C}}}$ to the lattice $\Lambda_{\mathcal{C}}$ and prove a relation between $\theta_{\Lambda_{\mathcal{C}}}$ and the complete weight enumerator evaluated on weight one theta series.

25 OCT 2019

### MULTICAST TRIANGULAR SEMILATTICE NETWORK

#### Involve, Vol. 12 (2019), No. 8, 1307–1328

Find it in the journal.

Journal Paper with A. Grosso, S. Varal and E. Zhu

### MULTICAST TRIANGULAR SEMILATTICE NETWORK.s

A. Grosso, F. Manganiello, S. Varal and E. Zhu Journal Paper

We investigate the structure of the code graph of a multicast network that has a characteristic shape of an inverted equilateral triangle. We provide a criterion that determines the validity of a receiver placement within the code graph, present invariance properties of the determinants corresponding to receiver placements under symmetries, and provide a complete study of these networks’ receivers and required field sizes up to a network of 4 sources. We also improve on various definitions related to code graphs.

1 MAY 2019

### AFFINE CARTESIAN CODES WITH COMPLEMENTARY DUALS

#### Finite Fields and Their Applications 57, 13-28

Find it in the journal.

Journal Paper with H. López and G. Matthews

### AFFINE CARTESIAN CODES WITH COMPLEMENTARY DUALS

H. López, F. Manganiello and G. Matthews Journal Paper

A linear code $C$ with the property that $C \cap C^\perp = \{0\}$ is said to be a linear complementary dual, or LCD, code. In this paper, we consider generalized affine Cartesian codes which are LCD. Generalized affine Cartesian codes arise naturally as the duals of affine Cartesian codes in the same way that generalized Reed–Solomon codes arise as duals of Reed–Solomon codes. Generalized affine Cartesian codes are evaluation codes constructed by evaluating multivariate polynomials of bounded degree at points in an m-dimensional Cartesian set over a finite field K and scaling the coordinates. The LCD property depends on the scalars used. Because Reed–Solomon codes are a special case, we obtain a characterization of those generalized Reed–Solomon codes which are LCD along with the more general result for generalized affine Cartesian codes. These results are independent of the characteristic of the underlying field.

25 APR 2019

### MATROIDAL ROOT STRUCTURE OF SKEW POLYNOMIALS OVER FINITE FIELDS

#### Journal of Discrete Mathematical Sciences and Cryptography, 22(3):377–389

Find it in the journal.

Journal Paper with T. Baumbaugh

### MATROIDAL ROOT STRUCTURE OF SKEW POLYNOMIALS OVER FINITE FIELDS

T. Baumbaugh and F. Manganiello Journal Paper

A skew polynomial ring $R=K[x;\sigma,\delta]$ is a ring of polynomials with non-commutative multiplication. This creates a difference between left and right divisibility, evaluations, and roots. A polynomial in such a ring may have more roots than its degree, which leads to the concepts of closures and independent sets of roots. In $R=\mathbb{F}_{q^m}[x;\sigma]$, this leads to the matroids $\mathfrak{M}_r$ and $\mathfrak{M}_l$ of right independent and left independent sets, which are isomorphic via the extension of the map $\phi : [1] \rightarrow [1]$ defined by $\phi(a)=a^{(m)}$, where $( i)=\frac{q^{i-1}-1}{q-1}$. Extending the field of coefficients of R results in a new ring $S$ of which $R$ is a subring, and if the extension is taken to include roots of an evaluation polynomial of $f (x)$, then all roots of $f (x)$ in $S$ are in the same conjugacy class.

8 OCT 2018

### BATCH CODES FROM HAMMING AND REED-MULLER CODES

#### Journal of Algebra Combinatorics Discrete Structures and Applications, 5:153 – 165

Find it in the journal.

Journal Paper with T. Baumbaugh

### BATCH CODES FROM HAMMING AND REED-MULLER CODES

T. Baumbaugh and F. Manganiello Journal Paper

Batch codes, introduced by Ishai et al., encode a string $x\in\sum^k$ into an $m$-tuple of strings, called buckets. In this paper we consider multiset batch codes wherein a set of $t$-users wish to access one bit of information each from the original string. We introduce a concept of optimal batch codes. We first show that binary Hamming codes are optimal batch codes. The main body of this work provides batch properties of Reed-Muller codes. We look at locality and availability properties of first order Reed-Muller codes over any finite field. We then show that binary first order Reed-Muller codes are optimal batch codes when the number of users is 4 and generalize our study to the family of binary Reed-Muller codes which have order less than half their length.

16 NOV 2017

### REPRESENTATIONS OF THE MULTICAST NETWORK PROBLEM

#### in ALGEBRAIC GEOMETRY FOR CODING THEORY AND CRYPTOGRAPHY, pages 1–23. Springer International Publishing

Find it in the book.

Book Chapters with S.E. Anderson, W. Halbawi, N. Kaplan, H.H. López, E. Soljanin, and J.L. Walker.

### REPRESENTATIONS OF THE MULTICAST NETWORK PROBLEM

S.E. Anderson, W. Halbawi, N. Kaplan, H.H. López, F. Manganiello, E. Soljanin, and J.L. Walker. Book Chapters

We approach the problem of linear network coding for multicast networks from different perspectives. We introduce the notion of the coding points of a network, which are edges of the network where messages combine and coding occurs. We give an integer linear program that leads to choices of paths through the network that minimize the number of coding points. We introduce the code graph of a network, a simplified directed graph that maintains the information essential to understanding the coding properties of the network. One of the main problems in network coding is to understand when the capacity of a multicast network is achieved with linear network coding over a finite field of size q. We explain how this problem can be interpreted in terms of rational points on certain algebraic varieties.

10 OCT 2017

### CODES FOR DISTRIBUTED STORAGE FROM 3-REGULAR GRAPHS

#### Discrete Applied Mathematics, 229:82–89

Find it in the journal.

Journal Paper with S. Gao, F. Knoll and G. Matthews

### CODES FOR DISTRIBUTED STORAGE FROM 3-REGULAR GRAPHS

S. Gao, F. Knoll, F. Manganiello and G. Matthews Journal Paper

This paper considers distributed storage systems (DSSs) from a graph theoretic perspective. A DSS is constructed by means of the path decomposition of a 3-regular graph into $P_4$ paths. The paths represent the disks of the DSS and the edges of the graph act as the blocks of storage. We deduce the properties of the DSS from a related graph and show their optimality.

17 MAY 2017

### MATROIDAL STRUCTURE OF SKEW POLYNOMIAL RINGS WITH APPLICATION TO NETWORK CODING

#### Finite Fields and Their Applications, 46:326-346

Find it in the journal.

Journal Paper with S. Liu and F. Kschischang

### MATROIDAL STRUCTURE OF SKEW POLYNOMIAL RINGS WITH APPLICATION TO NETWORK CODING

S. Liu, F. Manganiello and F. Kschischang Journal Paper

Over a finite field $\mathbb{F}_{q^m}$, the evaluation of skew polynomials is intimately related to the evaluation of linearized polynomials. This connection allows one to relate the concept of polynomial independence defined for skew polynomials to the familiar concept of linear independence for vector spaces. This relation allows for the definition of a representable matroid called the $\mathbb{F}_{q^m}[x;\sigma]$-matroid, with rank function that makes it a metric space. Specific submatroids of this matroid are individually bijectively isometric to the projective geometry of $\mathbb{F}_{q^m}$ equipped with the subspace metric. This isometry allows one to use the $\mathbb{F}_{q^m}[x;\sigma]$-matroid in a matroidal network coding application.

6 JUL 2015

### CONSTRUCTION AND DECODING OF GENERALIZED SKEW-EVALUATION CODES

#### In the proceeding of the 2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)

Find it is the proceedings of the workshop.

Conference Proceedings with S. Liu and F. Kschischang

### CONSTRUCTION AND DECODING OF GENERALIZED SKEW-EVALUATION CODES

S. Liu, F. Manganiello and F. Kschischang Conference Proceedings

Skew polynomials are elements of a noncommutative ring that, in recent years, have found applications in coding theory and cryptography. Skew polynomials have a well-defined evaluation map. This map leads to the definition of a class of codes called Generalized Skew-Evaluation codes that contains Gabidulin codes as a special case as well as other related codes with additional desirable properties. A Berlekamp-Welch-type decoder for an important class of these codes can be constructed using Kötter interpolation in skew polynomial rings.

17 SEP 2013

### SPREAD DECODING IN EXTENSION FIELDS

#### Finite Fields and Their Applications, 25(0):94–105

Find it in the journal.

Journal Paper with A.-L. Trautmann-Horlemann

### SPREAD DECODING IN EXTENSION FIELDS

A.-L. Trautmann-Horlemann and F. Manganiello Journal Paper

A spread code is a set of vector spaces of a fixed dimension over a finite field $\mathbb{F}_{q}$ with certain properties used for random network coding. It can be constructed in different ways which lead to different decoding algorithms. In this work we consider one such representation of spread codes and present a minimum distance decoding algorithm which is efficient when the code words, the received space and the error space have small dimension.

1 AUG 2013

### CYCLIC ORBIT CODES

#### IEEE Transactions on Information Theory, 59(11):7386-7404

Find it in the journal.

Journal Paper with M. Braun, J. Rosenthal and A.-L. Trautmann-Horlemann

### CYCLIC ORBIT CODES

A.-L. Trautmann-Horlemann, F. Manganiello, M. Braun and J. Rosenthal Journal Paper

A constant dimension code consists of a set of k-dimensional subspaces of $\mathbb{F}_{q^n}$. Orbit codes are constant dimension codes which are defined as orbits of a subgroup of the general linear group, acting on the set of all subspaces of $\mathbb{F}_{q^n}$. If the acting group is cyclic, the corresponding orbit codes are called cyclic orbit codes. In this paper, we show how orbit codes can be seen as an analog of linear codes in the block coding case. We investigate how the structure of cyclic orbit codes can be utilized to compute the minimum distance and cardinality of a given code and propose different decoding procedures for a particular subclass of cyclic orbit codes.

3 JAN 2013

### KÖTTER INTERPOLATION IN SKEW POLYNOMIAL RINGS

#### Designs, Codes and Cryptography, Volume 72, Issue 3, pp 593–608

Find it in the journal.

Journal Paper with S. Liu and F. Kschischang

### KÖTTER INTERPOLATION IN SKEW POLYNOMIAL RINGS

S. Liu, F. Manganiello and F. Kschischang Journal Paper

Skew polynomials are a noncommutative generalization of ordinary polynomials that, in recent years, have found applications in coding theory and cryptography. Viewed as functions, skew polynomials have a well-defined evaluation map; however, little is known about skew-polynomial interpolation. In this work, we apply Kötter’s interpolation framework to free modules over skew polynomial rings. As a special case, we introduce a simple interpolation algorithm akin to Newton interpolation for ordinary polynomials.

1 NOV 2012

### AN ALGEBRAIC APPROACH FOR DECODING SPREAD CODES

#### Advances in Mathematics of Communications, 6(4):443-466

Find it in the journal.

Journal Paper with E. Gorla and J. Rosenthal

### AN ALGEBRAIC APPROACH FOR DECODING SPREAD CODES

E. Gorla, F. Manganiello and J. Rosenthal Journal Paper

In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size $k\times n$ with entries in a finite field $\mathbb{F}_{q}$. Spread codes are a family of optimal codes with maximal minimum distance. We give a minimum-distance decoding algorithm which requires $\mathcal{O}((n-k)k^3)$ operations over an extension field $\mathbb{F}_{q^k}$. Our algorithm is more efficient than the previous ones in the literature, when the dimension $k$ of the codewords is small with respect to $n$. The decoding algorithm takes advantage of the algebraic structure of the code, and it uses original results on minors of a matrix and on the factorization of polynomials over finite fields.

17 JAN 2012

PhD Theses

### SPREAD CODES AND MORE GENERAL NETWORK CODES

F. Manganiello Theses

31 JUL 2011

### ON CONJUGACY CLASSES OF SUBGROUPS OF THE GENERAL LINEAR GROUP AND CYCLIC ORBIT CODES

#### In the proceeding of the 2011 IEEE International Symposium on Information Theory (ISIT)

Find it is the proceedings of the workshop.

Conference Proceedings with A.L. Trautmann-Horlemann and J. Rosenthal

### ON CONJUGACY CLASSES OF SUBGROUPS OF THE GENERAL LINEAR GROUP AND CYCLIC ORBIT CODES

F. Manganiello, A.L. Trautmann-Horlemann and J. Rosenthal Conference Proceedings

Orbit codes are a family of codes applicable for communications on a random linear network coding channel. The paper focuses on the classification of these codes. We start by classifying the conjugacy classes of cyclic subgroups of the general linear group. As a result, we are able to focus the study of cyclic orbit codes to a restricted family of them.

30 AUG 2010

### ORBIT CODES — A NEW CONCEPT IN THE AREA OF NETWORK CODING

#### In the proceeding of the 2010 IEEE Information Theory Workshop (ITW)

Find it is the proceedings of the workshop.

Conference Proceedings with A.L. Trautmann-Horlemann and J. Rosenthal

### ORBIT CODES — A NEW CONCEPT IN THE AREA OF NETWORK CODING

A.L. Trautmann-Horlemann, F. Manganiello and J. Rosenthal Conference Proceedings

We introduce a new class of constant dimension codes called orbit codes. The basic properties of these codes are derived. It will be shown that many of the known families of constant dimension codes in the literature are actually orbit codes.

6 JUL 2008

#### In the proceeding of the 2008 IEEE International Symposium on Information Theory (ISIT)

Find it is the proceedings of the workshop.

Conference Proceedings with E. Gorla and J. Rosenthal

### ON CONJUGACY CLASSES OF SUBGROUPS OF THE GENERAL LINEAR GROUP AND CYCLIC ORBIT CODES

F. Manganiello, E. Gorla and J. Rosenthal Conference Proceedings

In this paper we introduce the class of spread codes for the use in random network coding. Spread codes are based on the construction of spreads in finite projective geometry. The major contribution of the paper is an efficient decoding algorithm of spread codes up to half the minimum distance.

9 MAY 2008

### COMPUTATION OF THE WEIGHT DISTRIBUTION OF CRC CODES

#### Applicable Algebra in Engineering, Communication and Computing, 19(4):349-363

Find it in the journal.

Journal Paper

### COMPUTATION OF THE WEIGHT DISTRIBUTION OF CRC CODES

F. Manganiello Journal Paper

In this article, we illustrate an algorithm for the computation of the weight distribution of CRC codes. The recursive structure of CRC codes will give us an iterative way to compute the weight distribution of their dual codes starting from some “representative” words. Thanks to MacWilliams’ Theorem, the computation of the weight distribution of the dual codes can be easily brought back to that of CRC codes.

27 OCT 2005

Master Theses

### CALCOLO DELLA DISTRIBUZIONE DEI PESI NEI CODICI CICLICI ACCORCIATI

F. Manganiello Theses

.04

## AWARDS & GRANTS

• AWARDS
• 2019

• GRANTS
• 2019
2022

### NSF GRANT ECCS-1912702 - Co-PI

Awarded amount: $379,998 Other investigators: Y. Wang (PI) • 2016 2021 ### NSF GRANT DMS-1547399 - PI #### RTG: CODING THEORY, CRYPTOGRAPHY AND NUMBER THEORY Awarded amount:$2,126,971
Other investigators: S. Gao (Co-PI) and K. James (Co-PI)
Visit the homepage of the group for further information.
• 2012
2013

### Swiss NSF GRANT 138738 - PI

#### CODES, ALGORITHMS AND CRYPTOGRAPHY FOR RANDOM LINEAR NETWORK CODING

Fellowships for prospective researchers
• 2011
2012

### Swiss NSF GRANT 135934 - PI

#### CODES, ALGORITHMS AND CRYPTOGRAPHY FOR RANDOM LINEAR NETWORK CODING

Fellowships for prospective researchers
• CONFERENCE GRANTS
• 2017

### IEEE

#### SHANNON CENTENNIAL EVENT AT CLEMSON UNIVERSITY

Awarded amount: \$2,650
.05

## RESEARCH

LAB TEAM

### POSTDOCTORAL FELLOW

Dr. Machado joined the SMSS in August 2021 and his expertise are in coding theory and its applications to privacy and security.

### RTG POSTDOCTORAL FELLOW

Dr. Skelton joined the RTG group in August 2021. His expertises are in commutative algebra and combinatorics and will assist the RTG group in answering fundamental questions in coding theory and crypotography.

### RESEARCH ASSISTANT

His research interest was in number theory and is now expanding it to coding theory and cryptography.

### RESEARCH ASSISTANT

Her research interest is in post-quantum cryptography and is co-advised with Dr. Cartor.

FORMER TEAM MEMBERS

#### Postdoctoral fellows

• Ryann Cartor (Postoctoral Fellow - 2019-2021) now assistant professor at Clemson University.
• Hiram H. López (Postoctoral Fellow - 2016-2018) now assistant professor at Cleveland State University.
• Nina Rupert (RTG Postoctoral Fellow - 2017-2018) now course instructor at Western Governor University.

• Travis Baumbaugh (PhD Student - 2014-2020) now Cryptographer at ToposWare.

• Harrison Eggers (Master student - 2019-2020)
• Kristen Savary (Master student - 2017-2019)
• Alexander Joyce (Master student - 2017-2019)
.06

## TEACHING

• CURRENT
• Fall
2021

### MATH 1060 - Calculus in one variable I

#### Clemson University - Undergraduate Class

• TEACHING HISTORY at Clemson University

Fall 2020
• ### MATH 2190 - Introduction to mathematical Cryptography

#### Clemson University - Undergraduate Class

Spring 2019 and Spring 2017
• ### MATH 3110 - Linear Algebra

#### Clemson University - Undergraduate Class

Spring 2014, Fall 2014, Fall 2015, Fall 2016, Fall 2017, Fall 2018, Summer 1 2019, Summer 1 2019 and Summer 1 2021

Fall 2014

• ### MATH 8570 - Cryptography

#### Clemson University - Graduate Class

Spring 2015 and Spring 2021
• TEACHING HISTORY prior to Clemson University

Fall 2012

Spring 2011

Spring 2008
.07

## CONFERENCES

• VIRTUAL
• since APR 2021

### ACCESS - Algebraic Coding and Cryptography on the East coast Seminar Series - Seminar series - organizer

#### HOMEPAGE

with G. Matthews and E. Persichetti
• PLANNED
• APR 2022

### Algebraic Methods in Coding Theory and Communication - Workshop - organizer

#### Casa Matemática Oaxaca-BIRS, Oaxaca, Mexico

with E. Gorla, M. Greferath and H. López
• ORGANIZED
• OCT 2020

### Coding Theory, Cryptography, and Number Theory - AMS Special Sessions

#### AMS Fall Southeastern Virtual Sectional Meeting

with R. Cartor, S. Gao and K. James
• JAN 2020

### Coding Theory and Applications - AMS Special Session - organizer

#### AMS-MAA Joint Mathematics Meetings - Denver, CO, USA

with A. Beemer, I. Blake, C. Kelley
• JAN 2018

### Coding Theory and Applications - AMS Special Session

#### AMS-MAA Joint Mathematics Meetings - Baltimore, MD, USA

with H. López and G. Matthews
• AUG 2017

### Coding theory - Minisymposia

#### SIAM Conference on Applied Algebraic Geometry (AG17), Atlanta, GA, USA

with A. Ravagnani
• MAR 2017

### Coding Theory, Cryptography, and Number Theory - AMS Special Sessions

#### AMS Sectional Meetings - Charleston, SC, USA

with J. Brown, S. Gao, K. James and G. Matthews
• DEC 2016

### Shannon Centennial Event at Clemson

#### Clemson University - Clemson, SC, USA

with S. Gao, G. Matthews and Mike Pursley
• APR 2016

### Meeting on Algebraic Geometry for Applications (MAGA16)

#### Clemson University - Clemson, SC, USA

with M. Burr and S. Poznanovikj
• AUG 2015

### Coding theory - Minisymposia

#### SIAM Conference on Applied Algebraic Geometry (AG15) - Daejeon, South Korea

with A. Ravagnani
• JAN 2015

### Advances in Coding Theory - AMS Special Session

#### AMS-MAA Joint Mathematics Meetings - San Antonio, TX, USA

with G. Matthews and J. Walker