The material in this book is supported in part by the National Science Foundation under
CAREER grant CCF-0844796. Any opinions, findings and conclusions or recomendations …

This paper presents a review of the Prouhet Tarry Escott problem. The solutions of the
Prouhet Tarry Escott problem are significant because of its numerous applications. Available …

In this paper, we prove that explicit FRS codes and multiplicity codes achieve relaxed
generalized Singleton bounds for list size $ L\ge1. $ Specifically, we show the following:(1) …

Trace reconstruction considers the task of recovering an unknown string x∊ 0, ln given a
number of independent “traces”, ie, subsequences of x obtained by randomly and …

Trace reconstruction considers the task of recovering an unknown string given a number of
independent “traces”, ie, subsequences of obtained by randomly and independently …

We propose a novel post-quantum code-based digital signature algorithm whose security is
based on the difficulty of decoding Quasi-Cyclic codes in systematic form, and whose …

Establishing the complexity of bounded distance decoding for Reed--Solomon codes is a
fundamental open problem in coding theory, explicitly asked by Guruswami and Vardy IEEE …

The subset sum problem is an important theoretical problem with many applications, such as
in coding theory, cryptography, graph theory and other fields. One of the many aspects of …

The maximum likelihood decoding problem (MLD) is known to be NP-hard and its
complexity is strictly related to the security of some post-quantum cryptosystems, that is, the …

A weak pseudorandom function (WPRF) is a keyed function f_k:{0, 1\}^ n → {0, 1\} fk: 0, 1 n→
0, 1 such that, for a random key k, a collection of samples (x, f_k (x))(x, fk (x)), for uniformly …