The Invertible Bloom Lookup Table (IBLT) is a probabilistic data structu...
The rapid development of DNA storage has brought the deletion and insert...
de Bruijn sequences of order ℓ, i.e., sequences that contain each
ℓ-tupl...
Diameter perfect codes form a natural generalization for perfect codes. ...
The concept of DNA storage was first suggested in 1959 by Richard Feynma...
The rapid development of DNA storage has brought the deletion and insert...
The de Bruijn graph, its sequences, and their various generalizations, h...
The linear complexity of a sequence s is one of the measures of its
pred...
The Grassmannian G_q(n,k) is the set of all k-dimensional
subspaces of t...
A private proximity retrieval (PPR) scheme is a protocol which
allows a ...
A functional k-PIR code of dimension s consists of n servers storing
lin...
The combination network is one of the simplest and insightful networks i...
The Grassmannian G_q(n,k) is the set of all k-dimensional
subspaces of ...
A class of low-power cooling (LPC) codes, to control simultaneously both...
Private information retrieval has been reformulated in an
information-th...
Subspace codes are known to be useful in error-correction for random net...