Embedded Files
Matteo Bonini
(Aalborg Universitet)
On the Tensor of Rank-Metric Codes
Herivelto Martins Borges
(University of Sao Paulo)
Artin-Schreier Curves and the Number of Elements with Prescribed Norm and Trace
Giuseppe Cotardo
(Virginia Tech)
Quantum Anticodes
Andrea Ferraguti
(University of Turin)
Frobenius and settled elements in iterated Galois extensions
Alessandro Giannoni
(University of Naples "Federico II")
Additive QMDS Codes Beyond the MDS Length Bound
Heide Gluesing-Luerssen
(University of Kentucky)
The Cloud and Flock Polynomials of a q-Matroid
Giovanni Giuseppe Grimaldi
(University of Perugia)
On the classification of ovoids in finite classical polar spaces
Katie Haymaker
(Villanova University)
Cycle Structure of Spatially-Coupled Codes: Theory and Constructions
Hiram Lopez-Valdez
(Virginia Tech)
An algebraic approach to Norm-trace codes
Giuseppe Marino
(University of Naples "Federico II")
New MRD Codes from Linear Cutting Blocking Sets
Gretchen Matthews
(Virginia Tech)
Permutation decoding Hermitian and norm-trace curves
Permutation decoding is a process that utilizes the permutation automorphism group of a linear code to correct errors in received words. Given a received word, a set of automorphisms, called a PD set, moves errors out of the information positions so that the original message can be determined. In this talk, we investigate permutation decoding for certain families of algebraic geometry codes. Automorphisms of the underlying curve are used to specify permutation automorphisms of the code. Specifically, we describe permutation decoding sets that correct specific burst errors for one-point codes on Hermitian and norm-trace curves. This is joint work with Hiram Lopez, Monica Lichtenwalner, and Padmapani Seneviratne.
Kirsten Morris
(Virginia Tech)
Graphical Analysis of Codes from Quasi-Dyadic Matrices
Dyadic matrices are useful objects for creating codes, particularly quantum CSS codes, due to their regularity and algebraic structure. In this talk, we explore the graphical properties of quantum CSS codes built from quasi-dyadic matrices and present structural conditions that yield results on the absorbing sets, cycles, and girth of the associated Tanner graphs.
Alessandro Neri
(University of Naples "Federico II")
New developments on the Etzion–Silberstein conjecture
In 2009 Etzion and Silberstein proposed a conjecture on the largest dimension of a space of matrices over a finite field whose nonzero elements are supported on a given Ferrers diagram and all have rank lower bounded by a fixed positive integer. Since stated, their conjecture has been verified in a number of cases, but as of today, it still remains widely open. In this talk I will provide an overview on the state of the art on the topic, starting from the first findings, until very recent results.
Francesco Sica
(Florida Atlantic University)
Cryptanalysis of the double-LIP
The lattice isomorphism problem is related to standard lattice hard problems and has been proposed as the basis for new cryptographic constructions. It is the problem of recovering a unimodular matrix U, knowing U^T Q U and Q, where Q is a symmetric matrix with integer coefficients. We show that, given two generic instances of LIP with the same secret U, it is possible to recover U in polynomial time.
Pantelimon Stanica
(Naval Postgraduate School)
Overconstrained Character Sums and Tower Decompositions of Generalized Bent,
Plateaued and Landscape Functions
Marco Timpanella
(University of Perugia)
Algebraic-Geometric codes and their applications
Giovanni Zini
(University of Modena and Reggio Emilia)
Conics, Artin-Schreier extensions and automorphisms
In this talk some easy constructions are presented regarding Artin-Schreier extensions of plane conics and other plane or space rational curves over finite fields. The aim is to obtain old and new curves with many automorphisms (with respect to some birational invariants of the curve), by exploiting the geometry of the underlying rational curve. This is a joint work with Herivelto Borges and Jonathan Tilling.
Ferdinando Zullo
(Università degli Studi della Campania "Luigi Vanvitelli")
Linear analogs in additive combinatorics
We survey linear analogues of classical results in additive combinatorics, where subsets of abelian groups are replaced by subspaces of finite vector spaces. We show how these structural results provide new tools for the analysis and construction of subspace codes in network coding.
Page updated
Google Sites
Report abuse